Sciweavers

1888 search results - page 95 / 378
» Proof theory and computational analysis
Sort
View
112
Voted
ALT
2003
Springer
15 years 9 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
FOSSACS
2005
Springer
15 years 6 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
MIE
2008
128views Healthcare» more  MIE 2008»
15 years 1 months ago
Interface Terminologies: Bridging the Gap between Theory and Reality for Africa
In the United States and Europe, electronic health records (EHRs) allow information technology and decision-support to facilitate the activities of clinicians and are considered a...
Andrew S. Kanter, Amy Y. Wang, Fred E. Masarie Jr....
108
Voted
LICS
2009
IEEE
15 years 7 months ago
Wreath Products of Forest Algebras, with Applications to Tree Logics
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiew...
93
Voted
CIE
2007
Springer
15 years 6 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee