Genericity of Weakly Computable Objects
- 71 Downloads
In computability theory many results state the existence of objects that in many respects lack algorithmic structure but at the same time are effective in some sense. Friedberg and Muchnik’s answer to Post’s problem is one of the most celebrated results in this form. The main goal of the paper is to develop a general result that embodies a large number of these particular constructions, capturing the essential idea that is common to all of them, and expressing it in topological terms. To do so, we introduce the effective topological notions of irreversible function and directional genericity and provide two main results that identify situations when such constructions are possible, clarifying the role of topology in many arguments from computability theory. We apply these abstract results to particular situations, illustrating their strength and deriving new results. This paper is an extended version of the conference paper (Hoyrup 6) with detailed proofs and new results.
KeywordsComputable Generic Irreversible function Priority method
The author wishes to thank Peter Gács, Emmanuel Jeandel and Cristóbal Rojas for discussions on the subject and the anonymous referees for very useful comments that helped improving the readability of the paper.
- 2.Brattka, V.: Computable versions of Baire’s category theorem. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS, pp 224–235. Springer-Verlag, London (2001)Google Scholar
- 5.Hoyrup, M.: Randomness and the ergodic decomposition. In: Löwe, B., Normann, D., Soskov, I.N., Soskova, A.A. (eds.) CiE, volume 6735 of Lecture Notes in Computer Science, pp 122–131. Springer (2011)Google Scholar
- 6.Hoyrup, M.: Irreversible computable functions. In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France, volume 25 of LIPIcs, pp 362–373. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)Google Scholar
- 7.Hocking, J.G., Young, G.S.: Topology. Addison-Wesley series in mathematics. Dover Publications (1961)Google Scholar
- 8.Ingrassia, M.A.: P-Genericity for Recursively Enumerable Sets. PhD thesis. University of Illinois at Urbana-Champaign (1981)Google Scholar
- 11.Nies, A.: Computability and randomness. Oxford logic guides. Oxford University Press (2009)Google Scholar
- 15.Stephan, F., Wu, G.: Presentations of K-trivial reals and Ksolmogorov complexity. In: CiE, pp 461–469. Springer-Verlag, Berlin, Heidelberg (2005)Google Scholar
- 17.Weihrauch, K.: The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130, FernUniversität Hagen (1992)Google Scholar