On Relating Time and Space to Size and Depth 论文

1977SIAM Journal on Computing引用 341
Computability, Logic, AI AlgorithmsQuantum Computing Algorithms and ArchitectureCellular Automata and Applications

摘要

Turing machine space complexity is related to circuit depth complexity. The relationship complements the known connection between Turing machine time and circuit size, thus enabling us to expose the related nature of some important open problems concerning Turing machine and circuit complexity. We are also able to show some connection between Turing machine complexity and arithmetic complexity.