Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
k__
on Nov 25, 2021
|
parent
|
context
|
favorite
| on:
Is my cat Turing-complete?
All operations are O(1)?
blamestross
on Nov 26, 2021
[–]
busy beaver function of (a finite number) is hilariously big, but a constant. So there is a constant bound on the duration of all terminating programs using finite memory.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: