Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
daxfohl
on May 4, 2018
|
parent
|
context
|
favorite
| on:
The 8000th Busy Beaver number eludes ZF set theory...
Yeah I don't really know either. Something like if you name a number by saying BB(10000), but it's not computable, then have you actually named a number? But really that's just a boring question of how you referee the game.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: