54 search results - page 7 / 11 » cie 2007 |
116
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
133
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
117
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisa...
119
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...