×

zbMATH — the first resource for mathematics

On the computational complexity of algorithms. (English) Zbl 0131.15404

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. M. Turing, On computable numbers, with applications to the Entscheidungs problem, Proc. London Math. Soc. (2) 42 (1937), 230-265.
[2] Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. · Zbl 0080.00902
[3] Hisao Yamada, Real-time computation and recursive functions not real-time computable, IRE Trans. EC-11 (1962), 753 – 760. · Zbl 0124.25006
[4] J. Myhill, Linear bounded automata, WADD Tech. Note 60-165, Rep. No. 60-22, Univ. of Pennsylvania, June, 1960.
[5] Robert W. Ritchie, Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 139 – 173. · Zbl 0107.01001
[6] Noam Chomsky, On certain formal properties of grammars, Information and Control 2 (1959), 137 – 167. · Zbl 0088.10801
[7] J. Hartmanis and R. E. Stearns, Computational complexity of recursive sequences, Proc. Fifth Annual Sympos. on Switching Theory and Logical Design, Princeton, N. J. 1964. · Zbl 0156.25604
[8] Michael O. Rabin, Real time computation, Israel J. Math. 1 (1963), 203 – 211. · Zbl 0156.25603 · doi:10.1007/BF02759719 · doi.org
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.