Computational versus causal complexity

DOI10.1023/A:1011855915651MaRDI QIDQ2781923zbMATH OpenOpenAlexFDO

Authors Matthias Scheutz

Publication date 11 April 2002

Published in Minds and Machines (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011855915651

zbMATH Keywords

bisimulationcomputational complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in artificial intelligence (68T01)

Recommendations

• Against structuralist theories of computational implementation
• Does a rock implement every finite-state automaton?
• Computational mechanisms and models of computation
• A simplicity criterion for physical computation
• Computationalism

Cited in

(8)

• Does a rock implement every finite-state automaton?
• A computable expression of closure to efficient causation
• Causal computational complexity of distributed processes
• How downwards causation occurs in digital computers
• Functions, representations, and zombies: Information theoretic perspectives on three standard confusions in cognitive science
• A simplicity criterion for physical computation
• Against structuralist theories of computational implementation
• Is computational complexity a barrier to manipulation?

This page was built for publication: Computational versus causal complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781923)