Volume 775 of the series Lecture Notes in Computer Science pp 631645
Towards a theory of recursive structures
 David HarelAffiliated withDept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science
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.
 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
 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.