Pages that link to "Item:Q5845383"
From MaRDI portal
The following pages link to A variant of a recursively unsolvable problem (Q5845383):
Displaying 50 items.
- Deciding confluence for a simple class of relational transducer networks (Q269334) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
- Periodicity forcing words (Q496053) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- Decidability of operation problems for T0L languages and subclasses (Q553300) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- On complete one-way functions (Q734307) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Insertion languages (Q796994) (← links)
- A temporal logic for asynchronous hyperproperties (Q832224) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- Variations on the post correspondence problem for free groups (Q832925) (← links)
- On dynamic topological and metric logics (Q865049) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- Complexity and decidability for restricted classes of picture languages (Q909482) (← links)
- An algorithm deciding functional equivalence in a new class of program schemes (Q912596) (← links)
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- The unambiguity of segmented morphisms (Q967360) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Tetris and decidability (Q1029095) (← links)
- Existence of graphs with a given set of r-neighborhoods (Q1053037) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Database survivability under dynamic constraints (Q1087339) (← links)
- Projection of object histories (Q1099659) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Ambiguity in the developmental systems of Lindenmayer (Q1221634) (← links)
- A useful device for showing the solvability of some decision problems (Q1230657) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- On simplest possible solutions for Post Correspondence Problems (Q1323352) (← links)
- Flatwords and Post Correspondence Problem (Q1351939) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- The Post correspondence problem over a unary alphabet (Q1431872) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Binary (generalized) Post Correspondence Problem (Q1605309) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm (Q1679661) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
