Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
eli_gottlieb
on April 10, 2017
|
parent
|
context
|
favorite
| on:
Gödel's Incompleteness Theorems (2015)
All
formal systems capable of describing Turing-complete computation. All of them.
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
