Degrees of unsolvability associated with Markov algorithms
- 1 December 1972
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 1 (4) , 355-365
- https://doi.org/10.1007/bf00987253
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Meeting of the Association for Symbolic Logic, Atlantic City, 1971The Journal of Symbolic Logic, 1971
- The many-one equivalence of some general combinatorial decision problemsBulletin of the American Mathematical Society, 1971
- Quantificational variants on the halting problem for turing machinesMathematical Logic Quarterly, 1969
- The equivalence of some general combinatorial decision problemsBulletin of the American Mathematical Society, 1967
- Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue SystemsAnnals of Mathematics, 1966
- Machine Configuration and Word Problems of Given Degree of UnsolvabilityMathematical Logic Quarterly, 1965
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944