## Motivation and Background

by
We Take As
,
Andrej Bauer

### BibTeX

@MISC{As_motivationand,

author = {We Take As and Andrej Bauer},

title = {Motivation and Background},

year = {}

}

### OpenURL

### Abstract

P, also called the enumeration operators, are characterized by the equation F (x) = [ \Phi F (y) fi fi y x \Psi 1 for all x 2 P, where y x means that y is a finite subset of x. It follows that a continuous function is completely determined by the relation n 2 F (y) for n 2 N and y N: (1) We say a continuous function F : P ! P is computable when the corresponding relation (1) is recursively enumerable. Relation (1) can also be identified with sets in P using suitable encodings. Whenever a topological space X is represented as a subspace of<F8.35