Sciweavers

DMTCS
2003
89views Mathematics» more  DMTCS 2003»
13 years 8 months ago
On the Monotonic Computability of Semi-computable Real Numbers
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
Xizhong Zheng, George Barmpalias
DMTCS
2003
99views Mathematics» more  DMTCS 2003»
13 years 8 months ago
Combinatorial Problems Arising in SNP and Haplotype Analysis
It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of a...
Bjarni V. Halldórsson, Vineet Bafna, Nathan...
DMTCS
2003
93views Mathematics» more  DMTCS 2003»
13 years 8 months ago
Two Philosophical Applications of Algorithmic Information Theory
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
Gregory J. Chaitin