The paper claims that any system with recursive state maintenance and reliable history access can simulate a universal Turing machine, but the formal proof is a sketch and the necessity direction is not established.
Space-time tradeoffs f or linear recursion
1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.
1
Pith paper citing it
10
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Memory makes computation universal, remember?
The paper claims that any system with recursive state maintenance and reliable history access can simulate a universal Turing machine, but the formal proof is a sketch and the necessity direction is not established.