#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

a r t i c l e i n f o a b s t r a c t Keywords: Generalized computability Computability on topological algebra Computability on the reals Grzegorczyk–Lacombe computability We compare models of computation for partial functions f : R R. We consider four models: two concrete (Grzegorczyk–Lacombe and tracking computability), one abstract (approximability by a… (More)

We give some characterizations of semicomputability of sets of reals by programs in certain While programming languages over a topological partial algebra of reals. We show that such sets are semicomputable if and only if they are one of the following: (i) unions of effective sequences of disjoint algebraic open intervals; (ii) unions of effective sequences… (More)

- ‹
- 1
- ›