Sciweavers

709 search results - page 55 / 142
» An Equational Theory for Transactions
Sort
View
LICS
1991
IEEE
15 years 2 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
CSDA
2006
72views more  CSDA 2006»
14 years 11 months ago
Generalized theory of uncertainty (GTU) - principal concepts and ideas
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitan...
Lotfi A. Zadeh
CCA
2009
Springer
15 years 5 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 4 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ENTCS
2006
114views more  ENTCS 2006»
14 years 11 months ago
What is algebraic in process theory?
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Ita...
Bas Luttik