Towards a theory of recursive structures
 David Harel
 … show all 1 hide
Abstract
In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure or data base. In this paper we summarize our recent work on recursive structures and data bases, including (i) the high undecidability of many problems on recursive graphs, (ii) somewhat surprising ways of deducing results on the classification of NP optimization problems from results on the degree of undecidability of their infinitary analogues, and (iii) completeness results for query languages on recursive data bases.
 S. Abiteboul and V. Vianu, “Generic Computation and Its Complexity”, Proc. 23rd ACM Symp. on Theory of Computing, pp. 209–219, ACM Press, New York, 1991.
 R. Aharoni, M. Magidor and R. A. Shore, “On the Strength of König's Duality Theorem”, J. of Combinatorial Theory (Series B) 54:2 (1992), 257–290.
 D.R. Bean, “Effective Coloration”, J. Sym. Logic 41 (1976), 469–480.
 D.R. Bean, “Recursive Euler and Hamiltonian Paths”, Proc. Amer. Math. Soc. 55 (1976), 385–394.
 R. Beigel and W. I. Gasarch, unpublished results, 1986–1990.
 R. Beigel and W. I. Gasarch, “On the Complexity of Finding the Chromatic Number of a Recursive Graph”, Parts I & II, Ann. Pure and Appl. Logic 45 (1989), 1–38, 227–247.
 S. A. Burr, “Some Undecidable Problems Involving the EdgeColoring and Vertex Coloring of Graphs”, Disc. Math. 50 (1984), 171–177.
 A. K. Chandra and D. Harel, “Computable Queries for Relational Data Bases”, J. Comp. Syst. Sci. 21, (1980), 156–178.
 R. Fagin, “Generalized FirstOrder Spectra and PolynomialTime Recognizable Sets”, In Complexity of Computations (R. Karp, ed.), SIAMAMS Proceedings, Vol. 7, 1974, pp. 43–73.
 W. I. Gasarch and M. Lockwood, “The Existence of Matchings for Recursive and Highly Recursive Bipartite Graphs”, Technical Report 2029, Univ. of Maryland, May 1988.
 D. Harel, “Hamiltonian Paths in Infinite Graphs”, Israel J. Math. 76:3 (1991), 317–336. (Also, Proc. 23rd ACM Symp. on Theory of Computing, New Orleans, pp. 220–229, 1991.)
 T. Hirst and D. Harel, “Taking it to the Limit: On Infinite Variants of NPComplete Problems”, Proc. 8th IEEE Conf. on Structure in Complexity Theory, IEEE Press, New York, 1993.
 T. Hirst and D. Harel, “Completeness Results for Recursive Data bases”, 12th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1993, 244–252.
 P. G. Kolaitis and M. N. Thakur, “Logical definability of NP optimization problems”, 6th IEEE Conf. on Structure in Complexity Theory, pp. 353–366, 1991.
 A. Manaster and J. Rosenstein, “Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)”, Proc. London Math. Soc. 3 (1972), 615–654.
 A. Nerode and J. Remmel, “A Survey of Lattices of R. E. Substructures”, In Recursion Theory, Proc. Symp. in Pure Math. Vol. 42 (A. Nerode and R. A. Shore, eds.), Amer. Math. Soc., Providence, R. I., 1985, pp. 323–375.
 A. Panconesi and D. Ranjan, “Quantifiers and Approximation”, Theor. Comp. Sci. 107 (1993), 145–163.
 C. H. Papadimitriou and M. Yannakakis, “Optimization, Approximation, and Complexity Classes”, J. Comp. Syst. Sci. 43, (1991), 425–440.
 H. Rogers, Theory of Recursive Functions and Effective Computability, McGrawHill, New York, 1967.
 Title
 Towards a theory of recursive structures
 Book Title
 STACS 94
 Book Subtitle
 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24–26, 1994 Proceedings
 Pages
 pp 631645
 Copyright
 1994
 DOI
 10.1007/3540577858_177
 Print ISBN
 9783540577850
 Online ISBN
 9783540483328
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 775
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 David Harel ^{(1)}
 Author Affiliations

 1. Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel
Continue reading...
To view the rest of this content please follow the download PDF link above.