Post, E., 1946. A variant of a recursively unsolvable problem. Bull. AMS 52, 264--268. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Relative Undecidability in Term Rewriting Part 2: The.. - Geser, Middeldorp (Correct)
Decidable and Undecidable Problems About Quantum Automata - Blondel, Jeandel, Koiran (Correct)
The First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (5 citations) (Correct)
Keys, Nominals, and Concrete Domains - Lutz, Areces, Horrocks, Sattler (2002) (Correct)
Satisfiability of the Smallest Binary Program - Hanschke, Würtz (1993) (9 citations) (Correct)
Decidable and Undecidable Problems about Quantum Automata - Blondel, Jeandel, Koiran, .. (Correct)
Keys, Nominals, and Concrete Domains - Lutz, Areces, Horrocks, Sattler (2003) (Correct)
Smallest Horn Clause Programs - Devienne, Lebègue, Parrain.. (1994) (7 citations) (Correct)
On the Expressive Power of Temporal Concurrent Constraint.. - Nielsen, Palamidessi (2002) (1 citation) (Correct)
Incorporating XSL Processing Into Database Engines - Moerkotte (2002) (2 citations) (Correct)
Total Termination of Term Rewriting Is Undecidable - Zantema (1994) (4 citations) (Correct)
Relative Undecidability in Term Rewriting - Geser, Middeldorp, Ohlebusch.. (1996) (Correct)
(G)PCP for words of length at most two - Halava, Harju, Hirvensalo.. (2002) (Correct)
On the Complexity of RSRL - Kepser (Correct)
Decidable/Undecidable Properties of Conditional Term Rewriting .. - Aoto, Nagaya (Correct)
Undecidable Problems for Probabilistic Automata of Fixed.. - Blondel, Canterini (2001) (1 citation) (Correct)
On Reachability And Safety In Infinite-State Systems - Ibarra, Bultan, Su (Correct)
First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (5 citations) (Correct)
NExpTime-complete Description Logics with Concrete Domains - Lutz (2001) (11 citations) (Correct)
Undecidability of the Emptiness Problem of Reduction Automata.. - Treinen (2001) (Correct)
Generalized PCP Is Decidable for Marked Morphisms - Halava, Harju, al. (1999) (1 citation) (Correct)
An Undecidability Result Concerning Periodic Morphisms - Halava, Harju (Correct)
Mortality in Matrix Semigroups - Halava, Harju (2001) (Correct)
First-Order Theories of Concrete Domains - Treinen (2001) (Correct)
Predicate Logic and Tree Automata with Tests - Treinen (2000) (1 citation) (Correct)
Total Termination of Term Rewriting is Undecidable - Zantema (1996) (4 citations) (Correct)
Finite Substitutions and Integer Weighted Finite Automata - Halava (1998) (1 citation) (Correct)
Decidability and Undecidability of Marked PCP - Halava, Hirvensalo, de Wolf (1998) (Correct)
NExpTime-complete Description Logics with Concrete Domains - Lutz (2000) (11 citations) (Correct)
NExpTime-complete Description Logics with Concrete Domains - Lutz (2000) (11 citations) (Correct)
Reachability Analysis for Some Models of Infinite-State.. - Ibarra, Bultan, Su (2000) (3 citations) (Correct)
A Guide to Complexity Theory in Operations Research - Schirmer (1995) (Correct)
Predicate Logic and Tree Automata with Tests - Treinen (2000) (1 citation) (Correct)
A Survey of Computational Complexity Results in Systems and.. - Blondel, Tsitsiklis (2000) (32 citations) (Correct)
Tree Automata with Tests and Predicate Logic - Treinen (1999) (Correct)
A Guide to Complexity Theory in Operations Research - Schirmer (1996) (Correct)
A Strict Border for the Decidability of E-Unification for.. - Faßbender, Maneth (1996) (Correct)
Relative Undecidability in Term Rewriting - Geser, Middeldorp, Ohlebusch.. (1996) (Correct)
The First-Order Theory of Linear One-Step Rewriting is Undecidable - Treinen (1996) (2 citations) (Correct)
BioSystems 82 (2005) 1--19 - Toward Theory Of (Correct)
Theorie Algebrique des Langages Formels Temps Reel - Dima (2001) (Correct)
Query Planning and Optimization in Information Integration - Duschka (1997) (38 citations) (Correct)
Notes on Timed CCP - Nielsen, Valencia (Correct)
On Dynamic Topological and Metric Logics - Konev, Kontchakov, Wolter.. (Correct)
Decision Questions on Integer Matrices - Harju (Correct)
Infinite solutions of marked Post Correspondence Problem - Halava, Harju (2001) Self-citation (Post) (Correct)
On Marked Post Correspondence Problem - Halava (1999) Self-citation (Post) (Correct)
Binary (Generalized) Post Correspondence Problem - Halava, Harju, al. (2000) Self-citation (Post) (Correct)
Remarks on Generalized Post Correspondence Problem - Karhumäki, Krob (1996) (4 citations) Self-citation (Post) (Correct)
Some New Results on Post Correspondence Problem and Its.. - Halava, Harju (2001) (1 citation) Self-citation (Post) (Correct)
First 50 documents Next 50
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