Sciweavers

429 search results - page 83 / 86
» Turing computations on ordinals
Sort
View
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
IJCAI
2007
14 years 11 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
82
Voted
CORR
2007
Springer
103views Education» more  CORR 2007»
14 years 9 months ago
Physical limits of inference
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
David H. Wolpert
DSOM
2003
Springer
15 years 2 months ago
Eos: An Approach of Using Behavior Implications for Policy-Based Self-Management
Systems are becoming exceedingly complex to manage. As such, there is an increasing trend towards developing systems that are self-managing. Policy-based infrastructures have been ...
Sandeep Uttamchandani, Carolyn L. Talcott, David P...
CP
2000
Springer
15 years 1 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao