Reducibilities on real numbers
DOI10.1016/0304-3975(84)90129-4zbMATH Open0542.03033OpenAlexW1994458535MaRDI QIDQ795039FDOQ795039
Authors: Ker-I Ko 
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90129-4
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- A comparison of polynomial time reducibilities
- Computational complexity of real functions
- Nicht konstruktiv beweisbare Sätze der Analysis
- The maximum value problem and NP real numbers
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Recursive Real Numbers
- On the definitions of some complexity classes of real numbers
- Some observations on NP real numbers and P-selective sets
- On computable sequences
- Title not available (Why is that?)
- Recursion Theory and Dedekind Cuts
Cited In (11)
- Title not available (Why is that?)
- \(\delta\)-uniform BSS machines
- Title not available (Why is that?)
- The closure properties on real numbers under limits and computable operators.
- Equality is a jump
- 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)
- Title not available (Why is that?)
- 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)
