Machine Configuration and Word Problems of Given Degree of Unsolvability
- 1 January 1965
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 11 (2) , 149-175
- https://doi.org/10.1002/malq.19650110210
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Computability of Recursive FunctionsJournal of the ACM, 1963
- Tag systems and lag systemsMathematische Annalen, 1963
- Partial results regarding word problems and recursively enumerable degrees of unsolvabilityBulletin of the American Mathematical Society, 1962
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942
- On Computable Numbers, with an Application to the Entscheidungsproblem. A CorrectionProceedings of the London Mathematical Society, 1938
- On Computable Numbers, with an Application to the EntscheidungsproblemProceedings of the London Mathematical Society, 1937