Sciweavers

4850 search results - page 159 / 970
» Proof and Computation in Geometry
Sort
View
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 5 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
CHI
2005
ACM
15 years 8 months ago
Designing human friendly human interaction proofs (HIPs)
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
Kumar Chellapilla, Kevin Larson, Patrice Y. Simard...
ALIFE
2007
15 years 6 months ago
Computational Realizations of Living Systems
Robert Rosen’s central theorem states that organisms are fundamentally different to machines, mainly because they are ‘‘closed with respect to effcient causation.’’ The p...
Dominique Chu, Weng Kin Ho
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 6 months ago
A calculus for costed computations
We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of own...
Matthew Hennessy
LICS
2006
IEEE
16 years 14 days ago
A Proof of Strong Normalisation using Domain Theory
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
Thierry Coquand, Arnaud Spiwack