Sciweavers

DLT
2008
15 years 6 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...
185
Voted
UPP
2004
Springer
15 years 10 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner