Intuitively we see that the situation is fundamentally different from the Turing machine that halts if and only if the Goldbach conjecture is false because for Collatz the counter example must go off into infinity, while in Goldbach conjecture we can finitely check any failures.
Amazing.

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)

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