Skip to content
Better HN
Top
New
Best
Ask
Show
Jobs
Search
⌘K
undefined | Better HN
0 points
delusional
11mo ago
0 comments
Share
This is obviously demonstrably true. A Turing running in O(n) time must halt. The one in O(n) space is free not to.
0 comments
default
newest
oldest
thaumasiotes
11mo ago
Almondsetat's proof seems more obvious. Given O(n) time, you can only use O(n) space, so you're comparing "O(n) space, any amount of time" with "O(n) space, O(n) time", and it turns out you get more resources the first way.
j
/
k
navigate · click thread line to collapse