Sciweavers

2436 search results - page 25 / 488
» Comonadic Notions of Computation
Sort
View
JUCS
2008
122views more  JUCS 2008»
13 years 7 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
CSFW
1999
IEEE
13 years 11 months ago
Process Algebra and Non-Interference
The information security community has long debated the exact definition of the term `security'. Even if we focus on the more modest notion of confidentiality the precise def...
Peter Y. A. Ryan, Steve A. Schneider
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 8 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
FOCM
2011
113views more  FOCM 2011»
13 years 2 months ago
Finite Resolution Dynamics
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
Stefano Luzzatto, Pawel Pilarczyk
BIRTHDAY
2010
Springer
13 years 8 months ago
Three Paths to Effectiveness
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
Udi Boker, Nachum Dershowitz