OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
Turing machine that halts if and only if the Goldbach conjecture is false (27-state)
tags:
Goldbach conjecture
www.scottaaronson.com/papers/bb.pdf
Ancestors
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
Index
Incoming links
Turing machine that halts if and only if Collatz conjecture is false
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source