Pages that link to "Item:Q5545521"

The following pages link to Machine Configuration and Word Problems of Given Degree of Unsolvability (Q5545521):

Displaying 24 items.

• Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
• Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
• Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
• The reachability problem for Petri nets and decision problems for Skolem arithmetic (Q1148890) (← links)
• Cellular automata and intermediate degrees. (Q1401277) (← links)
• Representation of one-one degrees by decision problems for system functions (Q1837180) (← links)
• Many-one degrees associated with semi-Thue systems (Q1844662) (← links)
• On the classifiability of cellular automata (Q1978505) (← links)
• Recursively enumerable degress and the conjugacy problem (Q2533187) (← links)
• On recognising properties of groups which have solvable word problem (Q2539043) (← links)
• Representation of Turing reducibility by word and conjugacy problems in finitely presented groups (Q2550077) (← links)
• On the complexity of individual identity problems in semigroups (Q2556854) (← links)
• Combinatorial systems. I: Cylindrical problems (Q2558862) (← links)
• Many-one degrees associated with problems of tag (Q3214909) (← links)
• Degree problems for modular machines (Q3929725) (← links)
• Degrees of unsolvability associated with Markov algorithms (Q4052103) (← links)
• Combinatorial systems defined over one- and two-letter alphabets (Q4103085) (← links)
• INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS (Q4162665) (← links)
• Decision problems for cellular automata and their semigroups (Q5096855) (← links)
• The equivalence of some general combinatorial decision problems (Q5556434) (← links)
• The many-one equivalence of some general combinatorial decision problems (Q5619078) (← links)
• Decision problems for tag systems (Q5663844) (← links)
• Word problems and ceers (Q6096328) (← links)
• Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)