A note on computation MTs with time in instructions or with tapes of fixed length

Vladimir V. Rybakov<sup>ab

a</sup> A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russian Federation
^b Siberian Federal University Krasnoyarsk, Russian Federation

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.

Keywords: computations, universal Church–Turing Machines, time of computation.

UDC: 512.54

Received: 18.09.2020
Received in revised form: 23.11.2020
Accepted: 26.12.2020

Language: English

DOI: 10.17516/1997-1397-2021-14-1-69-73

Bibliographic databases:

•