Geodesic
Kolmogoroff algorithms are stronger than turing machines
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VII, Tome 60 (1976), pp. 29-37 
D. Yu. Grigor'ev. Kolmogoroff algorithms are stronger than turing machines. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VII, Tome 60 (1976), pp. 29-37. http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a2/
@article{ZNSL_1976_60_a2,
     author = {D. Yu. Grigor'ev},
     title = {Kolmogoroff algorithms are stronger than turing machines},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {29--37},
     year = {1976},
     volume = {60},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a2/}
}
TY  - JOUR
AU  - D. Yu. Grigor'ev
TI  - Kolmogoroff algorithms are stronger than turing machines
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1976
SP  - 29
EP  - 37
VL  - 60
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a2/
LA  - ru
ID  - ZNSL_1976_60_a2
ER  - 
%0 Journal Article
%A D. Yu. Grigor'ev
%T Kolmogoroff algorithms are stronger than turing machines
%J Zapiski Nauchnykh Seminarov POMI
%D 1976
%P 29-37
%V 60
%U http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a2/
%G ru
%F ZNSL_1976_60_a2

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

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.