Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
lostmsu
70 days ago
|
parent
|
context
|
favorite
| on:
Did Turing prove the undecidability of the halting...
Not sure what are you trying to say. Surely the "subset of instances" is non-Turing complete.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
