28 search results - page 4 / 6 » cie 2009 |
CIE
2009
Springer
14 years 3 months ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the co...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...