Chapter

STACS 94

Volume 775 of the series Lecture Notes in Computer Science pp 631-645

Date:

Towards a theory of recursive structures

  • David HarelAffiliated withDept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science

* Final gross prices may vary according to local VAT.

Get Access

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.