OurBigBook
About
$
Donate
Sign in
Sign up
by
Ciro Santilli
(
@cirosantilli,
34
)
Turing machine that halts if and only if the Goldbach conjecture is false
(27-state)
...
Decision problem
Halting problem
Busy beaver
Busy beaver scale
Automated theorem proving by halting problem reduction
Conjecture reduction to a halting problem
Like
(0)
0 By others
on same topic
0 Discussions
Updated
2024-11-15
Created
1970-01-01
See my version
tags:
Goldbach conjecture
www.scottaaronson.com/papers/bb.pdf
Ancestors
(13)
Conjecture reduction to a halting problem
Automated theorem proving by halting problem reduction
Busy beaver scale
Busy beaver
Halting problem
Decision problem
Computational problem
Computer science
Computer
Information technology
Area of technology
Technology
Home
Incoming links
(1)
Turing machine that halts if and only if Collatz conjecture is false
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