Machine Configuration and Word Problems of Given Degree of Unsolvability

Mathematical Logic Quarterly 11 (2):149-175 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19650110210

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: J. C. Shepherdson, Yehoshua Bar-Hillel, Machine Configuration and Word Problems of Given Degree of Unsolvability; J. C. Shepherdson, Machine Configuration and Word Problems of Given Degree of Unsolvability. [REVIEW]W. E. Singletary - 1968 - Journal of Symbolic Logic 33 (1):120-121.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
Single premise post canonical forms defined over one-letter alphabets.Charles E. Hughes - 1974 - Journal of Symbolic Logic 39 (3):489-495.
Inductive inference and unsolvability.Leonard M. Adleman & M. Blum - 1991 - Journal of Symbolic Logic 56 (3):891-900.
Review: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.
Word associations contribute to machine learning in automatic scoring of degree of emotional tones in dream reports.Reza Amini, Catherine Sabourin & Joseph De Koninck - 2011 - Consciousness and Cognition 20 (4):1570-1576.
Differential effects of stimulus frequency and graphic configuration in free- and forced-choice experiments.Warren E. Foote & Leston L. Havens - 1967 - Journal of Experimental Psychology 73 (3):340.
Two variable implicational calculi of prescribed many-one degrees of unsolvability.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):39-44.
Review: S. Tennenbaum, Degree of Unsolvability and the Rate of Growth of Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
Review: P. S. Novikov, On Algorithmic Unsolvability of the Word Problem. [REVIEW]William W. Boone - 1954 - Journal of Symbolic Logic 19 (1):58-60.
Review: M. D. Gladstone, Some Ways of Constructing a Propositional Calculus of any Required Degree of Unsolvability. [REVIEW]W. E. Singletary - 1969 - Journal of Symbolic Logic 34 (3):505-506.

Analytics

Added to PP
2013-11-24

Downloads
5 (#1,505,296)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Word problems and ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.
Degree problems for modular machines.Daniel E. Cohen - 1980 - Journal of Symbolic Logic 45 (3):510-528.
Many-one degrees associated with problems of tag.C. E. Hughes - 1973 - Journal of Symbolic Logic 38 (1):1-17.
Decision problems for tag systems.Stål Aanderaa & Dag Belsnes - 1971 - Journal of Symbolic Logic 36 (2):229-239.

View all 6 citations / Add more citations

References found in this work

Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
A Note on Universal Turing Machines.M. D. Davis & Martin Davis - 1970 - Journal of Symbolic Logic 35 (4):590-590.

Add more references