|
Zapiski Nauchnykh Seminarov LOMI, 1976, Volume 60, Pages 29–37
(Mi znsl2067)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Kolmogoroff algorithms are stronger than turing machines
D. Yu. Grigor'ev
Abstract:
A predicate is constructed which is recognizable in real time by a Kolmogoroff algorithm but which is not recognizable in real time by a machine with polynomial accessibility.
Citation:
D. Yu. Grigor'ev, “Kolmogoroff algorithms are stronger than turing machines”, Studies in constructive mathematics and mathematical logic. Part VII, Zap. Nauchn. Sem. LOMI, 60, "Nauka", Leningrad. Otdel., Leningrad, 1976, 29–37; J. Soviet Math., 14:5 (1980), 1445–1450
Linking options:
https://www.mathnet.ru/eng/znsl2067 https://www.mathnet.ru/eng/znsl/v60/p29
|
Statistics & downloads: |
Abstract page: | 310 | Full-text PDF : | 148 |
|