Search results
News
General Theory of Computability
(bibliography)
by Lavrov I.A.
By Author Name:
English: A-B-C-D-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z
Русские: А-Б-В-Г-Д-Е-Ж-З-И-К-Л-М-Н-О-П-Р-С-Т-У-Ф-Х-Ц-Ч-Ш-Щ-Э-Ю-Я
Search
Tennenbaum S. [1962] Degrees of unsolvability and the rate of growth of functions Proc Symp. Math. Theory of Automata, (New-York, 1963), Mickowave Res. st. Symp., ser.12, Polytechnic Press, N.Y., 71-73 65.06.54 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.T Takeuti G. Talasbaeva Z.T. Tanaka H. Tarski A. Tennenbaum S. Terwijn S.A. Thomason S.K. Thompson S. Thuraisingham M.B. Thurber J. J. Titgemeyer D. Tompa M. Torenvliet L. Trachtenbrot B.A. Trotter W. Truss J.K. Tucker J. V. Turing A.M. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Watnick R. [1984] A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings J. Symbolic Logic, 49, № 2, 563-569 85.01.62 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.