Sciweavers

31 search results - page 3 / 7
» Computing the Noncomputable
Sort
View
JSYML
2007
95views more  JSYML 2007»
13 years 6 months ago
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
TC
2010
13 years 26 days ago
Speculatively Redundant Continued Logarithm Representation
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
Tomas Brabec
ENTCS
2002
77views more  ENTCS 2002»
13 years 6 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
BIOSYSTEMS
2007
95views more  BIOSYSTEMS 2007»
13 years 6 months ago
Physical limits of computation and emergence of life
The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...
Abir U. Igamberdiev
AICOM
2002
103views more  AICOM 2002»
13 years 6 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen