Sciweavers

1055 search results - page 33 / 211
» Enumerations in computable structure theory
Sort
View
MFPS
1993
14 years 2 months ago
Some Quasi-Varieties of Iteration Theories
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
Stephen L. Bloom, Zoltán Ésik
ENTCS
2006
109views more  ENTCS 2006»
13 years 10 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
BIRTHDAY
2009
Springer
14 years 2 months ago
Pervasive Theory of Memory
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buers and store buer forwarding, cache coherence protocols, o...
Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer
ENVSOFT
2002
82views more  ENVSOFT 2002»
13 years 10 months ago
Radiative perturbation theory: a review
Radiative perturbation theory is a computational technique which can greatly ease the burden of repeated solution of the radiative transfer equation for model atmospheres which di...
Michael A. Box
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
14 years 2 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...