5964 search results - page 409 / 1193 » A theory of speculative computation |
168
click to vote
IPL
2006
15 years 7 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
212
click to vote
FUIN
2010
15 years 5 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
198
click to vote
TCS
2010
15 years 2 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
250
click to vote
LICS
2012
IEEE
13 years 10 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
175
click to vote
SC
1993
ACM
15 years 11 months ago
1993
ACM
Within the past few years, computer graphics has played a decisive role in transforming the field of molecular modeling into an intemaiional industry. While computer scientists ar...