Undecidability over Continuous Time

DOI10.1093/JIGPAL/JZL004zbMath1122.03042OpenAlexW1997958137MaRDI QIDQ3424115

Costa, José Félix, Jerzy Mycka

Publication date: 15 February 2007

Published in: Logic Journal of 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

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

Related Items (4)

The P\(\neq\) NP conjecture in the context of real and complex analysis ⋮ Analog computation beyond the Turing limit ⋮ Computability on reals, infinite limits and differential equations ⋮ A foundation for real recursive function theory

This page was built for publication: Undecidability over Continuous Time