Dimiter Skordev, Andreas Weiermann, Ivan Georgiev
Abstract
The article concerns subrecursive computability of real numbers. Certain significant real numbers are shown to be M2-computable, and the set of the M2-computable real numbers is shown to be closed under the elementary functions of calculus.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The article concerns subrecursive computability of real numbers. Certain significant real numbers are shown to be M2-computable, and the set of the M2-computable real numbers is shown to be closed under the elementary functions of calculus.
Key concepts: Computable analysis, Computability, Real number, Computable function, Computable number, Mathematics, Real analysis, Set (abstract data type)