๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rudimentary interpretation of two-tape turing computation

โœ Scribed by V. A. Nepomnyashehii

Publisher
Springer US
Year
1973
Tongue
English
Weight
577 KB
Volume
6
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recursively enumerable subsets of Rq in
Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machine
โœ Ning Zhong ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 997 KB

In this paper we compare recursively enumerable subsets of R" in two computing models over real numbers: the Blum-Shub-Smale machine and the oracle Turing machine. We prove that any Turing RE open subset of RY is a BSS RE set, while a Turing RE closed set may not be a BSS RE set. As an application