On the subrecursive computability of several famous constants

MaRDI QIDQ3518435zbMATH OpenFDO

Authors Dimiter Skordev

Publication date 8 August 2008

Full work available at URL http://www.jucs.org/jucs_14_6/on_the_subrecursive_computability

zbMATH Keywords

computable real numberEuler's constantGrzegorczyk classesLiouville's numberlower elementary functionssecond Grzegorczyk class

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computation over the reals, computable analysis (03D78)

Recommendations

• \(\mathcal{E}^2\)-computability of \(e\), \(\pi\) and other famous constants
• M^2-computable real numbers
• Rudimentary of two famous real numbers
• Continued fractions of primitive recursive real numbers
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions

Cited in

(7)

• On subrecursive complexity of integration
• Continued fractions of primitive recursive real numbers
• Rudimentary of two famous real numbers
• Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
• \(\mathcal{E}^2\)-computability of \(e\), \(\pi\) and other famous constants
• Uniform and conditional-computability of some nonelementary real functions
• scientific article; zbMATH DE number 7809184 (Why is no real title available?)

This page was built for publication: On the subrecursive computability of several famous constants

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