793 search results - page 79 / 159 » Argumentation and standards of proof |
181
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
129
click to vote
STOC
2004
ACM
16 years 29 days ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
97
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
112
Voted
ALT
2008
Springer
15 years 9 months ago
2008
Springer
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
92
Voted
CIE
2009
Springer
15 years 7 months ago
2009
Springer
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...