Abstract
Every recursively enumerable set of integers (r.e. set) is enumerable by a primitive recursive function. But if the enumeration is required to be one-one, only a proper subset of all r.e. sets qualify. Starting from a collection of total recursive functions containing the primitive recursive functions, we thus define a sub-computability as an enumeration of the r.e. sets that are themselves one-one enumerable by total functions of the given collection. Notions similar to the classical computability ones are introduced and variants of the classical theorems are shown. We also introduce sub-reducibilities and study the related completeness notions. One of the striking results is the existence of natural (recursive) sets which play the role of low (non-recursive) solutions to Post’s problem for these sub-reducibilities. The similarity between sub-computabilities and (complete) computability is surprising, since there are so many missing r.e. sets in sub-computabilities. They can be seen as toy models of computability.
The research presented in this paper has been made possible by the support of the French ANR grants NAFIT (ANR-08-DEFIS-008-01) and EMC (ANR-09-BLAN-0164-01).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Friedman, H., Sheard, M.: Elementary descent recursion and proof theory. Annals of Pure and Applied Logic 71(1), 1–45 (1995)
Koz’minyh, V.V.: On a presentation of partial recursive functions by compositions. Algebra i Logika 11(3), 270–294 (1972) (in Russian)
Kristiansen, L.: Papers on subrecursion theory. Ph.D. thesis, Department of Informatics, University of Oslo (1996)
Kristiansen, L.: A jump operator on honest subrecursive degrees. Archive for Mathematical Logic 37(2), 105–125 (1998)
Kristiansen, L.: Low n , high n , and intermediate subrecursive degrees. In: Calude, D. (ed.) Combinatorics, Computation and Logic, pp. 286–300. Springer, Singapore (1999)
Kristiansen, L., Schlage-Puchta, J.C., Weiermann, A.: Streamlined subrecursive degree theory. Annals of Pure and Applied Logic ( to appear, 2011)
Nies, A.: Computability and Randomness. Oxford University Press, Oxford (2009)
Odifreddi, P.: Classical Recursion Theory. Elsevier, North-Holland, Amsterdam (1988)
Odifreddi, P.: Classical Recursion Theory, vol. II. North Holland - Elsevier, Amsterdam (1999)
Rathjen, M.: The realm of ordinal analysis. In: Cooper, S.B., Truss, J. (eds.) Sets and Proofs, pp. 219–279. Cambridge University Press, Cambridge (1999)
Rose, H.E.: Subrecursion: Functions and Hierarchies, Oxford Logic Guides, vol. 9. Oxford University Press, USA (1984)
Veblen, O.: Continuous increasing functions of finite and transfinite ordinals. Trans. Amer. Math. Soc. 9, 280–292 (1908)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Givors, F., Lafitte, G. (2011). Sub-computabilities. In: Owe, O., Steffen, M., Telle, J.A. (eds) Fundamentals of Computation Theory. FCT 2011. Lecture Notes in Computer Science, vol 6914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22953-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-22953-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22952-7
Online ISBN: 978-3-642-22953-4
eBook Packages: Computer ScienceComputer Science (R0)