Mutual upper bounds of size and time for a Turing machine and a Markov–Post algorithm for mutual simulations

A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of space and a polynomial of time for the Turing machine, respectively. No more than two-letter extensions of the exterior alphabet are used.

Saved in:

Bibliographic Details
Published in:	Vestnik, St. Petersburg University. Mathematics Vol. 48; no. 2; pp. 72 - 74
Main Authors:	Kosovskii, N. K., Kosovskaya, T. M., Kosovskii, N. N.
Format:	Journal Article
Language:	English
Published:	New York Allerton Press 01.04.2015
Subjects:	Analysis Mathematics Mathematics and Statistics Markov–Post algorithm mutual upper bounds of complexity time and space complexity of algorithms Turing machine
ISSN:	1063-4541, 1934-7855
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	A Markov–Post algorithm and a Turing machine, which have mutual upper bounds on time and space, are proven to be interchangeable up to a linear function of space and a polynomial of time for the Turing machine, respectively. No more than two-letter extensions of the exterior alphabet are used.
ISSN:	1063-4541 1934-7855
DOI:	10.3103/S1063454115020053