Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dilemma
on Aug 8, 2016
|
parent
|
context
|
favorite
| on:
Computing machinery and intelligence (1950)
>they are both expressible in terms of what he called a Universal Machine.
Prove it.
zingermc
on Aug 8, 2016
[–]
We are still waiting on a proof of the Church-Turing Thesis, so maybe that is next on the agenda.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Prove it.