Is universal computation a myth?
From MaRDI portal
Publication:4686642
DOI10.1007/978-3-319-46376-6_2zbMATH Open1396.68044OpenAlexW2548218186MaRDI QIDQ4686642FDOQ4686642
Authors: Selmer Bringsjord
Publication date: 4 October 2018
Published in: Emergent Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_2
Recommendations
Cites Work
- Vivid: a framework for heterogeneous problem solving
- Title not available (Why is that?)
- Mathematical methods in linguistics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursively enumerable sets of positive integers and their decision problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A set of postulates for the foundation of logic. II
- An introduction to Gödel's theorems
- Proof verification and proof discovery for relativity
- On the provability, veracity, and AI-relevance of the Church-Turing thesis
- Second thoughts about Church's thesis and mathematical proofs
Cited In (4)
Uses Software
This page was built for publication: Is universal computation a myth?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686642)