Main public logs

Combined display of all available logs of BusyBeaverWiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:35, 27 December 2025 Azerty talk contribs created page User:Azerty/Turing Completeness (Created page with "This is a list of systems that are Turing-complete. To be Turing-complete, a system must have unbounded memory, access to that memory, and loops that can repeat forever. == Turing-complete systems == * Turing machines with 2 states and a blank tape * Turing machines with 2 symbols and a blank tape * Turing machines with 15 states and 2 symbols * Turing machines with 9 states and 3 symbols * Turing machines with 6 states and 4 symbols * Turing machines with 5 states an...") Tag: Visual edit