Machines in the theory of computable functions. Tutorial. Marchenkov S.S., Savitsky I.V.

Determines for both well -known computing devices (Turing machines, machines with arbitrary access to memory, Minsk cars, two -legged non -sensitive machines of Turing), and some machines that have appeared relatively recently (stack register machines, register machines with counter, counters with the summer). For each type of machine, the results are set out on computable functions that quite fully characterize the computational capabilities of the type of machine under consideration and connect the corresponding classes of computable functions with well -known classes of recursive functions.

for students, graduate students and researchers specializing in the field of discrete mathematics and cybernetics.