reducibilitypolynomial-timeCauchy sequence representationrecursive real functionstruth-table oracle Turing machine
Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30) Constructive and recursive analysis (03F60)
Recommendations
Cites work
- scientific article; zbMATH DE number 3143694 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A comparison of polynomial time reducibilities
- Computational complexity of real functions
- Nicht konstruktiv beweisbare Sätze der Analysis
- On computable sequences
- On the definitions of some complexity classes of real numbers
- Recursion Theory and Dedekind Cuts
- Recursive Real Numbers
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Some observations on NP real numbers and P-selective sets
- The maximum value problem and NP real numbers
Cited in
(11)- \(\delta\)-uniform BSS machines
- scientific article; zbMATH DE number 4053594 (Why is no real title available?)
- The closure properties on real numbers under limits and computable operators.
- Equality is a jump
- scientific article; zbMATH DE number 1929453 (Why is no real title available?)
- Real reduction theory
- The Turing closure of an Archimedean field
- Reducibility in Aℝ(K), Cℝ(K), and A(K)
- In Memoriam: Ker-I Ko (1950–2018)
- scientific article; zbMATH DE number 1747708 (Why is no real title available?)
- On reduction properties
This page was built for publication: Reducibilities on real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795039)
