4940 search results - page 48 / 988 » On the Complexity of Universal Programs |
DLT
2008
15 years 3 months ago
2008
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...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
136
click to vote
CLEF
2006
Springer
15 years 5 months ago
2006
Springer
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. The main objective of this study is to evaluate the retr...
124
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
NN
2006
Springer
15 years 1 months ago
2006
Springer
The way of propagating and control of stochastic signals through Universal Learning Networks (ULNs) and its applications are proposed. ULNs have been already developed to form a s...