Universal recursively enumerable sets of strings (Q533863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Universal recursively enumerable sets of strings |
scientific article; zbMATH DE number 5886208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal recursively enumerable sets of strings |
scientific article; zbMATH DE number 5886208 |
Statements
Universal recursively enumerable sets of strings (English)
0 references
10 May 2011
0 references
In the paper under review, the main topic concerned is the question which recursively enumerable sets can be the domains of a universal plain [prefix-free] machine. The authors obtain some characterizations of the sets in question.
0 references
universal machines
0 references
domains of universal machines
0 references
recursively enumerable sets
0 references
0.9528878331184388
0 references
0.7849448919296265
0 references
0.766117513179779
0 references
0.7539328932762146
0 references
0.7438293695449829
0 references
