CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review th...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
G
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
traction for an Object-Oriented Calculus with Thread Classes Erika