Non-halting Turing machine

From BusyBeaverWiki
Revision as of 22:48, 3 November 2024 by Icy (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

(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 a complete classification of behaviors of Turing machines for arbitrarily high numbers of states.

Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=Non-halting_Turing_machine&oldid=1036"