Machine Configuration and Word Problems of Given Degree of Unsolvability
From MaRDI portal
Cited in
(24)- Some undecidability results for non-monadic Church-Rosser Thue systems
- Unsolvable algorithmic problems for semigroups, groups and rings
- The reachability problem for Petri nets and decision problems for Skolem arithmetic
- Cellular automata and intermediate degrees.
- Representation of one-one degrees by decision problems for system functions
- Many-one degrees associated with semi-Thue systems
- On the classifiability of cellular automata
- Recursively enumerable degress and the conjugacy problem
- On recognising properties of groups which have solvable word problem
- Representation of Turing reducibility by word and conjugacy problems in finitely presented groups
- On the complexity of individual identity problems in semigroups
- Combinatorial systems. I: Cylindrical problems
- Many-one degrees associated with problems of tag
- Degree problems for modular machines
- Degrees of unsolvability associated with Markov algorithms
- Combinatorial systems defined over one- and two-letter alphabets
- INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
- Decision problems for cellular automata and their semigroups
- The equivalence of some general combinatorial decision problems
- The many-one equivalence of some general combinatorial decision problems
- Decision problems for tag systems
- Word problems and ceers
- Classifying word problems of finitely generated algebras via computable reducibility
- Finite complete rewriting systems and the complexity of word problem
This page was built for publication: Machine Configuration and Word Problems of Given Degree of Unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545521)
