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

Stochastic languages and complexity of computation in probabilistic turing machines

โœ Scribed by A. V. Vaiser

Book ID
105058006
Publisher
Springer US
Year
1976
Tongue
English
Weight
507 KB
Volume
12
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

[Lecture Notes in Computer Science] Impl
[Lecture Notes in Computer Science] Implementation and Applications of Automata Volume 5148 || Persistent Computations of Turing Machines
โœ Ibarra, Oscar H.; Ravikumar, Bala ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 493 KB

The 13th International Conference On Implementation And Application Of - Tomata (ciaa 2008) Was Held At San Francisco State University, San Francisco, July 21โ€“24, 2008. This Volume Of Lecture Notes In Computer Science Contains The Papers That Were Presented At Ciaa 2008, As Well As The Abstracts Of