How much can analog and hybrid systems be proved (super-)Turing (Q2497875): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Olivier Bournez / rank
Normal rank
 
Property / author
 
Property / author: Olivier Bournez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.09.070 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119244842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achilles and the tortoise climbing up the arithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Turing Thesis over Arbitrary Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achilles and the tortoise climbing up the hyper-arithmetical hierarchy / 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: Machines, Computations, and Universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous-time computation with restricted integration capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concept of computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamical system which must be stable whose stability cannot be proved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some recent developments on Shannon's General Purpose Analog Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: General recursive functions of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with low-dimensional dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive function theory and numerical analysis / 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: Analog computation beyond the Turing limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real recursive functions and their hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativistic computers and the Turing barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many forms of hypercomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computable ordinary differential equation which possesses no computable solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wave equation with computable initial data such that its unique solution is not computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computation via neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of neural nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church's thesis meets the \(N\)-body problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation''; and some uncomputable quantum mechanical tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of analog computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical physics and the Church--Turing Thesis / rank
 
Normal rank

Latest revision as of 18:40, 24 June 2024

scientific article
Language Label Description Also known as
English
How much can analog and hybrid systems be proved (super-)Turing
scientific article

    Statements

    How much can analog and hybrid systems be proved (super-)Turing (English)
    0 references
    4 August 2006
    0 references
    0 references
    Church' thesis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references