OBSERVATIONS ABOUT THE DEVELOPNENT OF THEORETICAL COl-lPUTER SCIENCE
暂无分享,去创建一个
[1] Allan Borodin,et al. Computational Complexity and the Existence of Complexity Gaps , 1972, JACM.
[2] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[3] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.
[4] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.
[5] M. Rabin. Real time computation , 1963 .
[6] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .
[7] R. Smullyan. Theory of formal systems , 1962 .
[8] Juris Hartmanis,et al. On the State Assignment Problem for Sequential Machines. I , 1961, IRE Trans. Electron. Comput..
[9] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..
[10] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[11] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[12] Claude E. Shannon,et al. A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.