OurBigBook
About
$
Donate
Sign in
Sign up
Translated cycler Turing machine
Ciro Santilli
(
@cirosantilli,
37
)
...
Computer
Computer science
Computational problem
Decision problem
Halting problem
Turing machine decider
Updated
2025-07-16
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Bibliography:
discuss.bbchallenge.org/t/decider-translated-cyclers/34
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)
Skelet machine #1
Ancestors
(10)
Turing machine decider
Halting problem
Decision problem
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Home
Incoming links
(1)
Skelet machine #1 is infinite
View article source
Discussion
(0)
Subscribe (1)
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