Causal nets or what is a deterministic computation?

DOI10.1007/BF02084161zbMath0497.68026OpenAlexW2044730870MaRDI QIDQ5905276

Peter Gács, Leonid A. Levin

Publication date: 1982

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02084161

zbMATH Keywords

network approach to computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Renormalisation and computation II: time cut-off and the Halting Problem

Cites Work

• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Storage Modification Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Causal nets or what is a deterministic computation?