𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of Recursive Sets By Turing Machine

✍ Scribed by E. K. Blum


Publisher
John Wiley and Sons
Year
1965
Tongue
English
Weight
349 KB
Volume
11
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On a Class of Recursively Enumerable Set
✍ Farzad Didehvar πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 1 views

## Abstract We define a class of so‐called βˆ‘(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation β€œβˆˆβ€ and study its properties.

The Index Set of Injectively Enumerable
✍ Stephan Wehner πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 372 KB

## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is βˆ‘~5~ in the Arithmetical Hierarchy and I describe a proof for the βˆ‘~5~‐hardness of