CCA
2005
Springer
14 years 1 months ago
2005
Springer
CCA
2005
Springer
14 years 1 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
CCA
2005
Springer
14 years 5 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
CCA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract Stone Duality is a revolutionary theory that works directly with computable continuous functions, without using set theory, infinitary lattice theory or a prior theory o...
CCA
2005
Springer
14 years 5 months ago
2005
Springer
CCA
2005
Springer
14 years 5 months ago
2005
Springer
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
CCA
2005
Springer
14 years 5 months ago
2005
Springer
CCA
2005
Springer
14 years 5 months ago
2005
Springer
CCA
2005
Springer
14 years 5 months ago
2005
Springer
CCA
2005
Springer
14 years 5 months ago
2005
Springer