Pages that link to "Item:Q4919632"

The following pages link to Recursive Unsolvability of a problem of Thue (Q4919632):

Displaying 50 items.

• Undecidable questions related to Church-Rosser Thue systems (Q1839249) (← links)
• Many-one degrees associated with semi-Thue systems (Q1844662) (← links)
• Thue trees (Q1861534) (← links)
• Left-divisibility and word problems in single relation monoids (Q1924517) (← links)
• Generalized sums over histories for quantum gravity. II: Simplicial conifolds (Q1966070) (← links)
• The word problem for one-relation monoids: a survey (Q1982573) (← links)
• Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
• The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
• The origins of the halting problem (Q2043819) (← links)
• Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
• A Lyndon's identity theorem for one-relator monoids (Q2135760) (← links)
• Nested sequents for intuitionistic modal logics via structural refinement (Q2142093) (← links)
• Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
• The undecidability of the elementary theory of lattices of all equational theories of large signature (Q2311327) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• Process-centric views of data-driven business artifacts (Q2396822) (← links)
• Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
• The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
• On the decidability of semigroup freeness. (Q2905326) (← links)
• On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
• Polygraphs of finite derivation type (Q3130298) (← links)
• From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work (Q3294886) (← links)
• Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
• Hyperarithmetical Sets (Q3305318) (← links)
• Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← links)
• WHEN CHURCH-ROSSER BECOMES CONTEXT FREE (Q3401476) (← links)
• Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
• Generic complexity of undecidable problems (Q3503760) (← links)
• DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS (Q3643581) (← links)
• Efficient Computation in Groups and Simplicial Complexes (Q3669634) (← links)
• The word problem for cancellation semigroups with zero (Q3712329) (← links)
• Alfred Tarski and undecidable theories (Q3764095) (← links)
• Church-Rosser systems with respect to formal languages (Q3796797) (← links)
• (Q3885224) (← links)
• The word problem and the isomorphism problem for groups (Q3941599) (← links)
• The theory of recursive functions, approaching its centennial (Q3946156) (← links)
• Undecidability of the identity problem for finite semigroups (Q4008756) (← links)
• Word problems (Q4170710) (← links)
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS (Q4513305) (← links)
• Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE (Q4882918) (← links)
• Implementing Real Numbers With RZ (Q4918049) (← links)
• Solving the Conjugacy Decision Problem via Machine Learning (Q4960480) (← links)
• Surprising Areas in the Quest for Small Universal Devices (Q4982064) (← links)
• Undecidability of Algebras of Binary Relations (Q5015973) (← links)
• On public key cryptosystem based on the word problem in a group (Q5043917) (← links)
• An equational logic sampler (Q5055725) (← links)
• On ground AC-completion (Q5055778) (← links)
• On some algorithmic problems for groups and monoids (Q5055802) (← links)