Non-halting Turing machine: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

3 November 2024

  • curprev 22:4822:48, 3 November 2024‎ Icy talk contribs‎ 572 bytes +572‎ Created page with "(Very rough sketches and outlines) == Classification == * Cyclers * Translated cyclers * Bouncers * Bells ** Exponential bells ** Cubic bells ** Quartic bells ** etc... * Counters ** Regular ** Irregular ** Exponential/tetration... * Hybrid (counter-counter, bouncer-counter) * Fractals ** Cube-like fractals ** Christmas tree fractals * Spaghetti * Cellular automata By the uncomputability of the Busy Beaver function, it is reasonable to believe that there can never be..." Tag: Visual edit
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://wiki.bbchallenge.org/wiki/Non-halting_Turing_machine"