Recursion and topology on 2≤ω for possibly infinite computations

Theoretical Computer Science

Volumn 322, Issue 1 SPEC. ISS., 2004, Pages 85-136

  Becher, Verónica ^a   Grigorieff, Serge ^b,c  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TOPOLOGY; TURING MACHINES;

COMPUTABLE MAPS; INFINITE WORDS; METRIC SPACES;

COMPUTABILITY AND DECIDABILITY;

EID: 3342938401     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.026     Document Type: Article

References (53)

1. ≤ω (II): effective wadge reductions, in preparation.
2. ≤ω (III): partial maps, in preparation.
3. V. Becher, S. Grigorieff, θ ′ -Random reals and outputs of possibly infinite computations, submitted for publication.
4. Boasson L., Nivat M. Adherences of languages. J. Comput. System Sci. 20:1980;285-309.
5. N. Bourbaki, Topologie générale, Livre III, Chap. 1, 4ème éd., Hermann, Paris, 1965. English translation available.
6. Brattka V. Recursive characterization of computable real-valued functions and relations. Theoret. Comput. Sci. 162:1996;45-77.
7. V. Brattka, Bibliography on Constructivity, Computability and Complexity in Analysis, http://cca-net.de/publications/bibliography.html.
8. Chaitin G.J. A theory of program size formally identical to information theory. J. ACM. 22:1975;329-340. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/.
9. Chaitin G.J. Algorithmic entropy of sets. Comput. Math. Appl. 2:1976;233-245. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ #PL.
10. Duparc J. Wadge hierarchy and Veblen hierarchy, Part I: Borel sets of finite rank. J. Symbolic Logic. 66(1):2001;56-86.
11. Engelfriet J., Hoogeboom H.J. X-automata on. ω -words Theoret. Comput. Sci. 110:1993;1-51.
12. Ershov Y. Computable functionals of finite type. Algebra and Logic. 11(4):1972;203-242.
13. M. Ferbus-Zanda, S. Grigorieff, Refinement of the "up to a constant" ordering using constructive co-immunity. Application to the oracular Min/Max hierarchy of Kolmogorov complexity, in preparation.
14. R. Freund, L. Staiger, Numbers defined by Turing machines, Collegium Logicum, Annals of the Kurt Gödel Society, Vol. 2, 1996, pp. 118-137. http://www.informatik.uni-halle.de/̃staiger/.
15. Grzegorczyk A. Computable functionals. Fund. Math. 42:1955;168-202.
16. Grzegorczyk A. On the definition of computable functionals. Fund. Math. 42:1955;232-239.
17. Grzegorczyk A. On the definition of computable real continuous functions. Fund. Math. 44:1957;61-71.
18. T. Head, The adherences of languages as topological spaces, in: M. Nivat, D. Perrin (Eds.), Automata and Infinite Words, Lecture Notes in Computer Science, Vol. 192, Springer, Berlin, 1985, pp. 147-163.
19. Head T. The topological structure of adherence of regular languages. RAIRO, Theoret. Inform. Appl. 20:1986;31-41.
20. Kechris A.S. Classical Descriptive Set Theory. 1995;Springer, Berlin.
21. K. Kuratowski, Topology, Vol. 1, Academic Press, New York, 1966.
22. Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III. C. R. Acad. Sci. Paris. 240:1955;2478-2480 Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III. C. R. Acad. Sci. Paris. 241:1955;13-14 and 151-153.
23. Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III. C. R. Acad. Sci. Paris. 240:1955;2478-2480 Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I, II, III. C. R. Acad. Sci. Paris. 241:1955;13-14 and 151-153.
24. Lacombe D. Quelques procédés de définition en topologie récursive. Heyting A. Constructivity in Mathematics. 1958;129-158 North-Holland, Amsterdam.
25. Levin L. On the notion of random sequence. Soviet Math. Dokl. 14(5):1973;1413-1416.
26. Li M., Vitanyi P. An Introduction to Kolmogorov Complexity and its Applications. 2nd Edition:1997;Springer, Amsterdam.
27. Moschovakis Y.N. Descriptive Set Theory. 1980;North-Holland, Amsterdam.
28. Mostowski A. On computable sequences. Fund. Math. 44:1957;37-51.
29. P.G. Odifreddi, Classical Recursion Theory, Vol. 1, North-Holland, Amsterdam, 1989.
30. D. Perrin, J.E. Pin, Infinite Words, Pure and Applied Mathematics, Vol. 141, Academic Press, New York, 2004.
31. Pierce R.S. Compact zero-dimensional metric spaces of finite type. Mem. Amer. Math. Soc. 130:1972;1-64.
32. Redziejowski R. Infinite word languages and continuous mappings. Theoret. Comput. Sci. 43:1986;59-79.
33. Rogers H. Jr. Theory of Recursive Functions and Effective Computability. 2nd Edition, 1987:1967;McGraw-Hill, New York.
34. Schnorr C.P. Process complexity and effective random tests. J. Comput. System Sci. 7:1973;376-388.
35. C.P. Schnorr, A survey of the theory of random sequences, in: R.E. Butts, J. Hintikka (Eds.), Basic Problems in Methodology and Linguistics, D. Reidel, Dordrecht, 1977, pp. 193-210.
36. Shoenfield J.R. On degrees of unsolvability. Ann. Math. 69:1959;644-653.
37. J.R. Shoenfield, Recursion Theory, Lecture Notes in Logic, Vol. 1, 1993 (reprinted 2001) A. K. Peters, Natick, Massachussets.
38. Solovay R.M. On random r.e. sets. Arruda A.I., da Costa N.C.A., Chuaqui R. Non-Classical Logics, Model Theory and Computability. 1977;283-307 North-Holland, Amsterdam.
39. Staiger L. Hierarchies of recursive. ω -languages J. Inform. Process. Cybernet. EIK 22(5/6):1986;219-241.
40. Staiger L. Sequential mappings of. ω -languages J. Inform. Process. Cybernet. EIK 23(8/9):1987;415-439.
41. L. Staiger, ω -languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997, pp. 339-387, http://www.informatik.uni-halle.de/̃staiger/.
42. L. Staiger, On the power of reading the whole input tape, in: C.S. Calude, Gh. Pau (Eds.), Finite Versus Infinite: Contributions to an Eternal Dilemma, Discrete Mathematics and Theoretical Computer Science, Springer, Berlin, 2000, pp. 335-348. Preprint 99-15, 1999, http://www.informatik.uni- halle.de/̃staiger/.
43. Staiger L., Wagner K. Rekursive Folgenmengen I. Z. Math. Logik Grundlagen Math. 24:1978;523-538.
44. A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, 2nd Series, Vol. 42, 1936, pp. 230-265, Correction, Ibid, 43:544-546, 1937.
45. Wagner K. Arithmetische Operatoren. Z. Math. Logik Grundlagen Math. 22:1976;553-570.
46. K. Wagner, L. Staiger, Recursive ω -languages, FCT'77, Lecture Notes in Computer Science, Vol. 56, 1977, pp. 532-537.
47. Weihrauch K. Type 2 recursion theory. Theoret. Comput. Sci. 38:1985;17-33.
48. Weihrauch K. Computability. 1987;Springer, Berlin.
49. Weihrauch K. Computability on computable metric spaces. Theoret. Comput. Sci. 113:1993;191-210.
50. Weihrauch K. Computable analysis, An introduction. 2000;Springer, Berlin.
51. Weihrauch K., Kreitz C. Theory of representations. Theoret. Comput. Sci. 38:1985;35-53.
52. Weihrauch K., Kreitz C. Type 2 computational complexity of functions on Cantor space. Theoret. Comput. Sci. 82:1991;1-18.
53. Zhong N., Weihrauch K. Computability theory of generalized functions. J. ACM. 50(4):2003;469-505.