What is a universal computing machine?
type: Item
instance of: scholarly article
title: What is a universal computing machine?
zbMATH Open document ID: 1192.68262
author: Jean-Charles Delvenne
published in: Applied Mathematics and Computation
publication date: 2009-11-13T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5632585
zbMATH Keywords: Turing universality
zbMATH Keywords: dynamical systems
MaRDI profile type: Publication
full work available at URL: j.amc.2009.04.057
OpenAlex ID: W2082071877
cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: On the computational power of dynamical systems and hybrid systems
cites work: Q4830809
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Q3416093
cites work: Reliable cellular automata with self-organization
cites work: Computability with low-dimensional dynamical systems
cites work: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
cites work: Q3992465
cites work: Q5590814
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Unpredictability and undecidability in dynamical systems
cites work: Recursion theory on the reals and continuous-time computation
cites work: Dynamical recognizers: real-time language recognition by analog computers
cites work: Q4418687
cites work: Computability and Noncomputability in Classical Analysis
cites work: Recursive unsolvability of group theoretic problems
cites work: Q4231133
cites work: Q4825161
cites work: Q4485693
cites work: Q3150942
DOI: 10.1016/J.AMC.2009.04.057
description: scientific article; zbMATH DE number 5632585