DMTCS 2003 | Sciweavers

40

click to vote

DMTCS
2008

56views Mathematics» more DMTCS 2008»

Analysis of Some Parameters for Random Nodes in Priority Trees

14 years 6 months ago

Download info.tuwien.ac.at

Alois Panholzer

claim paper

Read More »

54

click to vote

DMTCS
2003

89views Mathematics» more DMTCS 2003»

On the Monotonic Computability of Semi-computable Real Numbers

14 years 7 months ago

Download www.barmpalias.net

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

claim paper

Read More »

50

click to vote

DMTCS
2003

102views Mathematics» more DMTCS 2003»

Boolean NP-Partitions and Projective Closure

14 years 7 months ago

Download www14.in.tum.de

Sven Kosub

claim paper

Read More »

39

click to vote

DMTCS
2003

99views Mathematics» more DMTCS 2003»

Combinatorial Problems Arising in SNP and Haplotype Analysis

14 years 7 months ago

Download www.umiacs.umd.edu

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...

claim paper

Read More »

44

click to vote

DMTCS
2003

93views Mathematics» more DMTCS 2003»

Two Philosophical Applications of Algorithmic Information Theory

14 years 7 months ago

Download www.cs.umaine.edu

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers