Does a rock implement every finite-state automaton?

DOI10.1007/BF00413692zbMATH Open0931.03010OpenAlexW1995434614WikidataQ29400243 ScholiaQ29400243MaRDI QIDQ1293029FDOQ1293029

Authors: David J. Chalmers 

Publication date: 28 February 2000

Published in: Synthese (Search for Journal in Brave)

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

Recommendations

• Against structuralist theories of computational implementation
• Computational versus causal complexity
• Computationalism
• Computationalism, the Church-Turing thesis, and the Church-Turing fallacy
• scientific article; zbMATH DE number 5064387

zbMATH Keywords

finite-state automataimplementationtheory of computationanalysis of mindcombinatorial state automatacomputational functionalismtheory of physical systemsunderstanding the mind

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Artificial intelligence (68T99) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Title not available (Why is that?)

Cited In (11)

• Concrete digital computation: what does it take for a physical system to compute?
• A Vindication of Program Verification
• The physics of implementing logic: Landauer's principle and the multiple-computations theorem
• What does it mean to say that a physical system implements a computation?
• On the physical implementation of logical transformations: generalized \(L\)-machines
• Computational versus causal complexity
• Objective computation versus subjective computation
• Computation, hypercomputation, and physical science
• When does a physical system compute?
• Freedom in the many-worlds interpretation
• Philosophy of Computation

This page was built for publication: Does a rock implement every finite-state automaton?

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