Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
FartyMcFarter
3 months ago
|
parent
|
context
|
favorite
| on:
Did Turing prove the undecidability of the halting...
What do you mean by dressing it up as a theorem? It is a theorem because there's a proof for it.
Tainnor
3 months ago
[–]
For example, here's a formally verified proof in Lean:
https://github.com/leanprover-community/mathlib4/blob/124731...
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: