Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
_ooqq
on Dec 17, 2019
|
parent
|
context
|
favorite
| on:
Kurt Gödel and the Mechanization of Mathematics
For one practical example, Gödel's incompleteness is directly related to decidability problems in CS. there's this glorious liar paradox machine discussed by Computerphile [0].
[0]
https://www.youtube.com/watch?v=macM_MtS_w4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[0] https://www.youtube.com/watch?v=macM_MtS_w4