𝔖 Bobbio Scriptorium
✦   LIBER   ✦

TuringL-machines and recursive computability forL-maps

✍ Scribed by Giangiacomo Gerla

Book ID
110678273
Publisher
Springer Netherlands
Year
1989
Tongue
English
Weight
645 KB
Volume
48
Category
Article
ISSN
0039-3215

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] Adap
[Lecture Notes in Computer Science] Adaptive and Natural Computing Algorithms Volume 6593 || Self-Organising Maps in Document Classification: A Comparison with Six Machine Learning Methods
✍ Dobnikar, Andrej; Lotrič, Uroš; Šter, Branko 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 281 KB

The two-volume set LNCS 6593 and 6594 constitutes the refereed proceedings of the 10th International Conference on Adaptive and Natural Computing Algorithms, ICANNGA 2010, held in Ljubljana, Slovenia, in April 2010. The 83 revised full papers presented were carefully reviewed and selected from a tot