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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Vestnik, St. Petersburg University. Mathematics Ročník 48; číslo 2; s. 72 - 74
Hlavní autoři:	Kosovskii, N. K., Kosovskaya, T. M., Kosovskii, N. N.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Allerton Press 01.04.2015
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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