Sciweavers

562 search results - page 81 / 113
» Concurrent Turing Machines
Sort
View
CONCUR
2008
Springer
15 years 1 months ago
A Notion of Glue Expressiveness for Component-Based Systems
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
Simon Bliudze, Joseph Sifakis
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
15 years 1 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...
ACL
1997
15 years 1 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
CSL
2010
Springer
15 years 29 days ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
CORR
2007
Springer
103views Education» more  CORR 2007»
14 years 11 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