|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
CHURCH, A. A set of postulates for the foundation of logic. Ann. Math. {2} 33 (1932), 346-366; 34 (1933).
|
| |
2
|
----. An unsolvable problem of elementary number theory. Amer. J. Math. 58 (1936), 345--363.
|
| |
3
|
--. A note on the Entscheidungsproblem. J. Symb. Logic 1 (1936), 40-41, 101--102.
|
| |
4
|
DAvis, M: Computability and Unsolvability. New York, 1958.
|
| |
5
|
ERsov, A.P. On operator algorithms. (Russian) Dok. Akad. Nauk 122 (1958), 967- 970. English translation, Automat. Express 1 (1959), 20-23.
|
| |
6
|
HERMES, I-I. Vorlesung ber Entscheidungsproblemen inn Mathematih rend Logik. Ausarb. Math. Phys. Vorlesungen, Vol. 15. Munster, 1955.
|
| |
7
|
HERMES, H. Die Universalitiit programmgesteuerter Rechenmaschinen. Math.-Phys. Semsterberichte (G5ttingen) 41 (1954), 42-53.
|
| |
8
|
KAPHENGST, H. Eine Abstrakte programmgesteuerte Rechenmasehine. Zeit. Math. Logik Grund. d. Math: 5 (1959), 366-379.
|
| |
9
|
KLEENE, S.C. General recursive functions of natural numbers, Math. Ann. 112 (1936), 727-742.
|
| |
10
|
----. A theory of positive integers in formal logic. Amer. J. Math. 57 (1935), 153-173, 219-244.
|
| |
11
|
----. h-definability and reeursiveness. Duke Math. J. 2 (1936), 340-353.
|
| |
12
|
----. Introduction to Metamathematics, Ch. 13. Princeton, 1952.
|
| |
13
|
5'LRov, A. A. Teoriya algorifmov. Tr. Mat. Inst. Steklov, No. 42. Moscow, 1954.
|
| |
14
|
Omnsci-nI,, W. Varianten yon T'aringmaschinen, Arch. math. Logik Grund., No. 4/I-2 (1958), 53-62.
|
| |
15
|
PiTER, R. Graphschemata and rekurive Funktionen, Dialectica 12 (1958), 373.
|
| |
16
|
POST, E. L. Finite combinatory processes--formulation, I. J. Symb. Logic 1 (1936), 103-t05.
|
| |
17
|
---. Formal reductions of the general combinatorial decision problem. Amer. J. Math. 65 (t943), 197-215.
|
| |
18
|
TUmNG, A. M. On computable numbers with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. {2}, 42 (1936-7), 230-265; addendum and corrigendum, 43 (1937), 544-546.
|
| |
19
|
----. Computability and X-definability. J. ymb. Logic 2 (1937), 153-163.
|
 |
20
|
|
| |
21
|
MINsz, M. Recursive unsolwbility of Post's problem. M.I.T. Lincoln Lab. Report 54G-0023.
|
| |
22
|
S.WLLY.XN, R. Jl. Theory of Formal Systems. Princeton, 1961.
|
| |
23
|
POST, E.L. Recursive unsolvability of a problem of Thue. J. Symb. Logic 12 (1947), 1-11.
|
| |
24
|
|
CITED BY 42
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968
|
|
|
Enrico Denti , Antonio Natali , Andrea Omicini, On the expressive power of a language for programming coordination media, Proceedings of the 1998 ACM symposium on Applied Computing, p.169-177, February 27-March 01, 1998, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stephen Edwards , Luciano Lavagno , Edward A. Lee , Alberto Sangiovanni-Vincentelli, Design of embedded systems: formal models, validation, and synthesis, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
|
|
|
|
|
|
|
|
|
Robert L. Constable , Steven S. Muchnick, Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems), Proceedings of the fourth annual ACM symposium on Theory of computing, p.1-17, May 01-03, 1972, Denver, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.4