What is a universal computing machine?
From MaRDI portal
Publication:1036530
DOI10.1016/j.amc.2009.04.057zbMath1192.68262OpenAlexW2082071877MaRDI QIDQ1036530
Publication date: 13 November 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.057
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A statistical model of neural network learning via the Cramer-Rao lower bound ⋮ Multidisciplinary Trends in Modern Artificial Intelligence: Turing’s Way
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of group theoretic problems
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Dynamical recognizers: real-time language recognition by analog computers
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Computability with low-dimensional dynamical systems
- On the computational power of dynamical systems and hybrid systems
- Recursion theory on the reals and continuous-time computation
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Computability and Noncomputability in Classical Analysis
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Unpredictability and undecidability in dynamical systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Reliable cellular automata with self-organization
This page was built for publication: What is a universal computing machine?
