Sciweavers

391 search results - page 17 / 79
» Constructive Equivalence Relations on Computable Probability...
Sort
View
ICALP
2009
Springer
15 years 11 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 5 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 11 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
65
Voted
SIAMSC
2010
119views more  SIAMSC 2010»
14 years 9 months ago
An Entropy Adjoint Approach to Mesh Refinement
This work presents a mesh refinement indicator based on entropy variables, with an application to the compressible Navier-Stokes equations. The entropy variables are shown to sati...
Krzysztof J. Fidkowski, Philip L. Roe
POPL
2008
ACM
15 years 11 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume