Edith Spaan, Leen Torenvliet, Peter van Emde Boas  Home/Search
Context
Related
| turing.wins.uva.nl/~lee...Analogy.ps.gz turing.wins.uva.nl/%7El...Analogy.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: turing.wins.uva.nl/~leen...myrefs (more) From: turing.wins.uva.nl/~leen...myrefs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this note we propose a model for unbounded nondeterministic computation which provides a very natural basis for the structural analogy between recursive function theory and computational complexity theory: P : NP ¸ = REC : RE At the same time this model presents an alternative version of the halting problem which has been known for a decade to be highly intractable. 1 Introduction Structural complexity theory is often presented as the theory in which the results obtained for classes of... (Update)
Active bibliography (related documents): More All
0.3: Effective Transformations on Infinite Trees, with Applications to.. - Harel (1986) (Correct)
0.3: Nonexpressibility of Fairness and Signaling - McAllester, Panangaden.. (1990) (Correct)
0.2: Subtyping of Context-Free Classes - Freudig, Löwe, Neumann, Trapp (1998) (Correct)
Similar documents based on text: More All
0.5: A Note on Time and Space - Leen Torenvliet Peter (Correct)
0.5: The Reconstruction of Dynamic Data Structures - Smid, Torenvliet, Boas, Overmars (1986) (Correct)
0.4: Bounded Reductions - Harry Buhrman Edith (1993) (Correct)
BibTeX entry: (Update)
@misc{ spaan-nondeterminism,
author = "Edith Spaan and Leen Torenvliet and Peter van Emde Boas",
title = "Nondeterminism, Fairness and a Fundamental Analogy",
url = "citeseer.ist.psu.edu/60580.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
170 Nondeterministic space is closed under complementation - Immerman - 1988
161 Recursively Enumerable Sets and Degrees (context) - Soare - 1987
127 with an application to the entscheidungsproblem (context) - Turing - 1936
96 finite automata and their decision problems (context) - Rabin, Scott - 1959
61 Countable nondeterminism and random assignment (context) - Apt, Plotkin - 1986
58 Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clarke - 1980
29 The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1987
17 Prentice Hall Series in Automatic Computation (context) - Dijkstra, of - 1976
14 Classes of languages and linear-bounded automata (context) - Kuroda - 1964
8 Proof rules and transformations dealing with fairness (context) - Apt, Olderog - 1983
6 Formal languages: origin and directions (context) - Greibach - 1981
5 Computable nondeterministic functions (context) - Chandra - 1978
4 Finite state languages (context) - Chomsky, Miller - 1958
1 Gulliver's Travels (context) - Swift - 1967
1 Endliche Automaten I Bibliographisches Institut (context) - Bohling, Indermark - 1969
Documents on the same site (http://turing.wins.uva.nl/~leen/myrefs.html): More
Bounded Reductions - Buhrman, Spaan, Torenvliet (1993) (Correct)
On the Structure of Complete Sets - Buhrman, Torenvliet (1994) (Correct)
Arithmetical Measure - Terwijn, Torenvliet (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC