On subrecursive representation of irrational numbers: contractors and Baire sequences

DOI10.1007/978-3-030-80049-9_28OpenAlexW3184575261MaRDI QIDQ2117793FDOQ2117793

Authors: Lars Kristiansen 

Publication date: 22 March 2022

Full work available at URL: http://hdl.handle.net/10852/86560

zbMATH Keywords

computational complexitycomputable analysiscontraction mapssubrecursionBaire sequencesrepresentation of irrationals

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Strongly uniform bounds from semi-constructive proofs
• Title not available (Why is that?)
• Continued Fractions without Tears
• On the complexity of conversion between classic real number representations
• On subrecursive representability of irrational numbers
• On subrecursive representability of irrational numbers, part II
• On primitive recursive real numbers
• Computable irrational numbers with representations of surprising complexity

Cited In (3)

• Subrecursive incomparability of the graphs of standard and dual Baire sequences
• Subrecursive graphs of representations of irrational numbers
• On subrecursive representability of irrational numbers, part II

This page was built for publication: On subrecursive representation of irrational numbers: contractors and Baire sequences

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