v2.9.0

New

A verified library of machines

Browse and share machines other people have built, from More ▸ Library (key 5). Every badge is a result the machine itself produced: the library's CI checks each machine with this app's own engine.

• Discover, Browse, Collections, My Library. Search by words or filters: type:DFA, by:login, badge:minimal, accepts:0110 / rejects:.
• Badges: tested, deterministic, minimal, halts / never-halts (with how the halting proof was found).
• Listings: the diagram with Try it running the machine on it, the formal definition typeset from the machine itself, and a Turing machine's run beside its halting proof.
• Submit from the app. Your submission becomes a PR credited to you; opening one of your own entries and submitting again updates it, and doing the same with someone else's creates a remix.
• Links: #lib=, #library= and #collection= share links, and automata-studio:// links in the desktop app.

Halting proofs for Turing machines

Analyze can now prove whether a Turing machine halts, and say which method proved it: simulation, a cycler, a translated cycler or backward reasoning. When no method can decide, it answers "unknown". The library's halts / never-halts badges are built on this.

What's Changed

• feat(analyze): prove whether a Turing machine halts by @thethinkmachine in #105
• feat(library): a verified library of machines by @thethinkmachine in #106

Full Changelog: v2.8.3...v2.9.0