3228 search results - page 572 / 646 » Computationally Sound Proofs |
112
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
129
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
137
Voted
MCU
2004
15 years 4 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
131
Voted
CCS
2011
ACM
14 years 3 months ago
2011
ACM
A significant and growing class of location-based mobile applications aggregate position data from individual devices at a server and compute aggregate statistics over these posi...
234
Voted
ICTAC
2010
Springer
15 years 2 months ago
2010
Springer
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...