Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
IsTom
8 days ago
|
parent
|
context
|
favorite
| on:
I vibed a proof of Conway's conjecture
Even more concretely, the halting problem for turing machines with halting problem oracle would be undecidable for them. And if you could solve that you won't believe what problem would be undecidable. It's turtles all the way up.
help
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: