What is a universal computing machine? (Q1036530): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of dynamical systems and hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable cellular automata with self-organization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with low-dimensional dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpredictability and undecidability in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theory on the reals and continuous-time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical recognizers: real-time language recognition by analog computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Noncomputability in Classical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of group theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150942 / rank
 
Normal rank

Latest revision as of 04:39, 2 July 2024

scientific article
Language Label Description Also known as
English
What is a universal computing machine?
scientific article

    Statements

    What is a universal computing machine? (English)
    0 references
    13 November 2009
    0 references
    0 references
    Turing universality
    0 references
    dynamical systems
    0 references
    0 references