Pages that link to "Item:Q4919632"
From MaRDI portal
The following pages link to Recursive Unsolvability of a problem of Thue (Q4919632):
Displayed 50 items.
- Relational lattices: from databases to universal algebra (Q299191) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- Computing homology using generalized Gröbner bases (Q386986) (← links)
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322) (← links)
- On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
- Generic complexity of finitely presented monoids and semigroups (Q451108) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- Algorithmically finite groups. (Q640937) (← links)
- Finding non-trivial elements and splittings in groups. (Q716463) (← links)
- On complete one-way functions (Q734307) (← links)
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Conjugacy in monoids with a special Church-Rosser presentation is decidable (Q801163) (← links)
- A new lower bound construction for commutative Thue systems with applications (Q808265) (← links)
- Contraction of Dirac matrices via chord diagrams (Q826437) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- All countable monoids embed into the monoid of the infinite random graph (Q960939) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Automaton semigroups (Q1034622) (← links)
- Unsolvability of the universal theory of finite groups (Q1054715) (← links)
- Model-theoretic and algorithmic questions in group theory (Q1063112) (← links)
- Unsolvability of problems of equality and divisibility in certain varieties of semigroups (Q1065939) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- The word and generator problems for lattices (Q1105626) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Recursive undecidability of the binding property for finitely presented equational classes (Q1151417) (← links)
- Sur la liaison entre problèmes combinatoires et algorithmiques (Q1156785) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- A field guide to equational logic (Q1201350) (← links)
- Historical evolution of the concept of homotopic paths (Q1205992) (← links)
- Well rewrite orderings and well quasi-orderings (Q1209622) (← links)
- Distributive lattices of subspaces and the equality problem for algebras with a single relation (Q1244344) (← links)
- On termination of one rule rewrite systems (Q1334676) (← links)
- Formal model of internal measurement: Alternate changing between recursive definition and domain equation (Q1373932) (← links)
- The undecidability of the unrestricted modified edit distance (Q1390869) (← links)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452) (← links)
- Composition-diamond lemma for associative conformal algebras. (Q1427371) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Undecidability of existential properties in picture languages (Q1575948) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- Decidability and independence of conjugacy problems in finitely presented monoids (Q1637219) (← links)
- Finite Gröbner basis algebras with unsolvable nilpotency problem and zero divisors problem (Q1643563) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Computing finite semigroups (Q1757008) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)