论文信息 - Kolmogoroff algorithms are stronger than turing machines

Kolmogoroff algorithms are stronger than turing machines

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.

D. Grigor'ev | D. Yu. Grigor'ev

[1] A. Schonage,et al. REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES , 1973 .

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] S. Cook,et al. ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[4] F. C. Hennie,et al. On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..