Concrete digital computation: what does it take for a physical system to compute?
DOI10.1007/S10849-011-9147-8zbMATH Open1305.03006OpenAlexW2031433925MaRDI QIDQ2255184FDOQ2255184
Authors: Nir Fresco 
Publication date: 9 February 2015
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/eispapers/1723
Recommendations
representationTuring machinecognitioncomputabilityalgorithm executionconcrete digital computationsituated computers
Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) General topics in artificial intelligence (68T01)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Does a rock implement every finite-state automaton?
- What is computation?
- Computability and Recursion
- Church Without Dogma: Axioms for Computability
- Title not available (Why is that?)
- Turing oracle machines, online computing, and three displacements in computability theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Functional individuation, mechanistic implementation: the proper way of seeing the mechanistic view of concrete computation
- Data, signals and information in digital computation
- Computationalism
- Long-arm functional individuation of computation
- Computational mechanisms and models of computation
- The instructional information processing account of digital computation
- When does a physical system compute?
This page was built for publication: Concrete digital computation: what does it take for a physical system to compute?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255184)
