429 search results - page 52 / 86 » Turing computations on ordinals |
CSR
2007
Springer
15 years 6 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
FUIN
2006
14 years 11 months ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
74
Voted
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this article we present the framework of Possibilistic Influence Diagrams (PID), which allow to model in a compact form problems of sequential decision making under un...
120
click to vote
JAC
2008
15 years 1 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...