Sciweavers

DLT
2008
14 years 1 months ago
Universal Recursively Enumerable Sets of Strings
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
Cristian S. Calude, André Nies, Ludwig Stai...