Undecidability over Continuous Time

DOI10.1093/JIGPAL/JZL004MaRDI QIDQ3424115zbMATH OpenOpenAlexFDO

Authors Jerzy Mycka, José Félix Costa

Publication date 15 February 2007

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7f4e991d0d04ba390f617b6a020ffc85b05b9812

zbMATH Keywords

real numbersrecursive functionsundecidable problemsreal recursive vector functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Undecidable Problems About Timed Automata
• An undecidable problem for timed automata
• scientific article; zbMATH DE number 512815
• Undecidability results for low complexity time classes
• Undecidability and intuitionistic incompleteness
• Undecidability of state complexity
• scientific article; zbMATH DE number 1512704
• Undecidability in Some Structures Related to Computation Theory
• Undecidability, incompleteness and Arnol'd problems
• Undecidability and finite automata

Cited in

(8)

• scientific article; zbMATH DE number 1909821 (Why is no real title available?)
• Computability on reals, infinite limits and differential equations
• The Undecidability of the Existence of Zeros of Real Elementary Functions
• scientific article; zbMATH DE number 166937 (Why is no real title available?)
• A foundation for real recursive function theory
• Decidability problems for meta-\(R\)-functions
• The P\(\neq\) NP conjecture in the context of real and complex analysis
• Analog computation beyond the Turing limit

This page was built for publication: Undecidability over Continuous Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424115)