×

zbMATH — the first resource for mathematics

Turing-machines and the Entscheidungsproblem. (English) Zbl 0118.01602

PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] Ackermann, W.: Solvable cases of the decision problem. North-Holland, Amsterdam 1954. · Zbl 0056.24505
[2] Bernays, P.: Remarques sur les problème de la décision en logique élémentaire. Edition de centre nat. de la rech. scient.13, 39-44 (1958), Paris.
[3] Church, A.: A note on the Entscheidungsproblem. J. Symbolic Logic1, 40-41, 101-102 (1936). · Zbl 0014.38503 · doi:10.2307/2269326
[4] Suranyi, J.: Reduktionstheorie des Entscheidungsproblems. Budapest 1959.
[5] Trachténbrot, B. A.: Névozmo?nost’ algorifma dlá problemy razré?imosti na koné?nyh klassah. Doklady Akadémii Nauk SSSR, n. s.,70, 569-572 (1950).
[6] Turing, A. M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. ser. 2,42, 230-265 (1936-7);43, 544-546 (1937). · Zbl 0016.09701 · doi:10.1112/plms/s2-42.1.230
[7] Wang, H.: Proving theorems by pattern recognition II. Bell System Technical J.40, 1-41 (1961).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.