OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

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
 0 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
Tags: Goldbach conjecture
www.scottaaronson.com/papers/bb.pdf

 Ancestors (13)

  1. Conjecture reduction to a halting problem
  2. Automated theorem proving by halting problem reduction
  3. Busy beaver scale
  4. Busy beaver
  5. Halting problem
  6. Decision problem
  7. Computational problem
  8. Computer science
  9. Computer
  10. Information technology
  11. Area of technology
  12. Technology
  13.  Home

 Incoming links (1)

  • Turing machine that halts if and only if Collatz conjecture is false

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook