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

DOI10.1007/3-540-55808-X_9zbMath1493.68143MaRDI QIDQ5096822

Juraj Wiedermann

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80) Other nonclassical models of computation (68Q09)

Related Items

Parallel turing machines with one-head control units and cellular automata

Cites Work

• Unbounded hardware is equivalent to deterministic Turing machines
• Towards a complexity theory of synchronous parallel computation
• Physical parallel devices are not much faster than sequential ones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak parallel machines: A new class of physically feasible parallel machine models