by Ciro Santilli (@cirosantilli, 37)
Like a cycler, but the cycle starts at an offset.
To see infinity, we check that if the machine only goes left N squares until reaching the repetition, then repetition must only be N squares long.

Tagged (1)

Ancestors (10)

  1. Turing machine decider
  2. Halting problem
  3. Decision problem
  4. Computational problem
  5. Computer science
  6. Computer
  7. Information technology
  8. Area of technology
  9. Technology
  10. Home

Incoming links (1)

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version