Unbounded hardware is equivalent to deterministic Turing machines

DOI10.1016/0304-3975(83)90044-0zbMath0532.68053OpenAlexW2069149028WikidataQ113882252 ScholiaQ113882252MaRDI QIDQ789180

Louis Monier, Bernard Chazelle

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90044-0

zbMATH Keywords

parallel computationcomplexity classessystolic architecturesmodels of computationphysical computationdeterministic Turing machinesplanar digital circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Weak parallel machines: A new class of physically feasible parallel machine models

Cites Work

• Area-time tradeoffs for matrix multiplication and related problems in VLSI models
• A parallel algorithm for constructing minimum spanning trees
• The Area-Time Complexity of Binary Multiplication
• Unnamed Item

This page was built for publication: Unbounded hardware is equivalent to deterministic Turing machines