A predicative and decidable characterization of the polynomial classes of languages
UNSPECIFIED (2001) A predicative and decidable characterization of the polynomial classes of languages. THEORETICAL COMPUTER SCIENCE, 250 (1-2). pp. 83-99. ISSN 0304-3975Full text not available from this repository.
Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are decidable (membership can be decided by syntactic inspection to the constructions), predicative (according to points of view by Leivant and others), and are obtained by means of increasing restrictions to course-of-values recursion on trees (represented in a dialect of Lisp). (C) 2001 Elsevier Science B.V. All rights reserved.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Journal or Publication Title:||THEORETICAL COMPUTER SCIENCE|
|Publisher:||ELSEVIER SCIENCE BV|
|Date:||6 January 2001|
|Number of Pages:||17|
|Page Range:||pp. 83-99|
Actions (login required)