Siberian Federal University 
- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2021 14 (1)
- Authors
- Rybakov, Vladimir V.
- Contact information
- Rybakov, Vladimir V.: Siberian Federal University Krasnoyarsk, Russian Federation; A.P. Ershov Institute of Informatics Systems Novosibirsk, Russian Federation;
- Keywords
- computations; universal Church-Turing Machines; time of computation
- Abstract
In this short note we analyze the computation algorithms modelled by Church-Turing-Post machines with algorithms for computation which use amount of time spent for computation (number of steps) in their own definitions. We notice some difference and illustrate that there are distinctions in behaviour of such algorithms; also we consider working of MTs on tapes of fixed length and observe again noticed difference
- Pages
- 69–73
- DOI
- 10.17516/1997-1397-2021-14-1-69-73
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/137825
Journal of Siberian Federal University. Mathematics & Physics / A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length
Full text (.pdf)