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

Probabilistics Turing machines and recursively enumerable Dedekind cuts

โœ Scribed by M. Chrobak; B.S. Chlebus

Book ID
113162689
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
406 KB
Volume
19
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recursion Theory and Dedekind Cuts
Recursion Theory and Dedekind Cuts
โœ Robert I. Soare ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› American Mathematical Society ๐ŸŒ English โš– 540 KB
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

Mathematical Methods of the Theory of St
Mathematical Methods of the Theory of Stochastic Automata.by A. Bertoni; A. Blikle;Functions Computable in the Limit by Probabilistic Machines.by R. V. Freivald;Some Properties of Limit Recursive Functions.by B. Goetze; R. Klette;An Approach to Correctness Proofs of Semicoroutines.by Ole-Johan Dahl;The axiomatization Problem of a Theory of Linear Languages.by G. Wechsung;Modular Approach to the Logical Theory of Programs.by L. Banachowski;Mathematical Foundations of Motivation Languages and Synthesis Maps.by Pierangelo Miglioli;ฯ‰+-Valued Algorithmic Logic as a Tool to Investigate Procedures.by H. Rasiowa;Procedures, formal Computations and Models.by Andrzej Salwicki
โœ Review by: Steven S. Muchnick ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Association for Symbolic Logic ๐ŸŒ English โš– 98 KB