On Some Computability Notions for Real Functions

@article{Skordev2013OnSC,
  title={On Some Computability Notions for Real Functions},
  author={Dimiter Skordev},
  journal={Computability},
  year={2013},
  volume={2},
  pages={67-73}
}
A widely used approach to computability of real functions is the one in Grzegorczyk’s style originating from [1]. This approach uses computable transformations of infinitistic names of real numbers, as well as general quantifiers over these names. Other approaches allow avoiding the use of such names at least in some cases. An approach of this other kind is, for instance, the one of Tent and Ziegler from [5]. In the present paper, the equivalence of a certain approach in Grzegorczyk’s spirit… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Computable functions of reals

View 3 Excerpts
Highly Influenced

Some subrecursive versions of Grzegorczyk's Uniformity Theorem

Math. Log. Q. • 2004
View 3 Excerpts
Highly Influenced

Uniform computability of real functions

D. Skordev
Years Faculty of Mathematics and Informatics, St. Kliment Ohridski University of Sofia (Proceedings of the Scientific Session held in Sofia on October • 2009
View 1 Excerpt