Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
From MaRDI portal
Publication:4787860
DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200210)48:1+<91::AID-MALQ91>3.0.CO;2-L" /><91::AID-MALQ91>3.0.CO;2-L 10.1002/1521-3870(200210)48:1+<91::AID-MALQ91>3.0.CO;2-LzbMath1018.03048OpenAlexW1972276887MaRDI QIDQ4787860
Publication date: 17 August 2003
Full work available at URL: https://doi.org/10.1002/1521-3870(200210)48:1+<91::aid-malq91>3.0.co;2-l
Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)
Related Items (5)
Continued fractions of primitive recursive real numbers ⋮ Unnamed Item ⋮ Fifty years of the spectrum problem: survey and new results ⋮ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants ⋮ On subrecursive complexity of integration
This page was built for publication: Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
