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

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.