Degrees of unsolvability associated with Markov algorithms
From MaRDI portal
Publication:4052103
Cites work
- scientific article; zbMATH DE number 3267349 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3371593 (Why is no real title available?)
- Machine Configuration and Word Problems of Given Degree of Unsolvability
- Quantificational variants on the halting problem for turing machines
- Recursively enumerable sets of positive integers and their decision problems
- The equivalence of some general combinatorial decision problems
- The many-one equivalence of some general combinatorial decision problems
- Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
Cited in
(3)
This page was built for publication: Degrees of unsolvability associated with Markov algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052103)