8512 search results - page 264 / 1703 » Computing Theory With Relevance |
159
Voted
TOPLAS
2010
15 years 4 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
143
click to vote
FOCM
2011
2011
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
15 years 1 months ago
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
166
Voted
ENTCS
2008
15 years 5 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
142
click to vote
JACIII
2007
15 years 6 months ago
2007
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
127
Voted
STACS
2009
Springer
16 years 28 days ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...