Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

All operations are O(1)?


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: