Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
k__
4y ago
0 comments
Save
Share
All operations are O(1)?
0 comments
1 comments · 1 top-level
top
newest
oldest
blamestross
4y ago
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.
j
/
k
navigate · click thread line to collapse