37 search results - page 4 / 8 » The Complexity of Orbits of Computably Enumerable Sets |
ESANN
2007
13 years 9 months ago
2007
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
APAL
2008
13 years 7 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
WCC
2005
Springer
14 years 28 days ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
SAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
APAL
2010
13 years 7 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...