Computations with oracles that measure vanishing quantities.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1315, doi. 10.1017/S0960129516000219
- By:
- Publication type:
- Article
Works matching IS 09601295 AND DT 2017 AND VI 27 AND IP 8
Results: 14
1
2
Properties of domain representations of spaces through dyadic subbases.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1625, doi. 10.1017/S0960129516000207
- By:
- Publication type:
- Article
3
Some results related to the continuity problem.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1601, doi. 10.1017/S0960129516000190
- By:
- Publication type:
- Article
4
Quantifying over events in probability logic: an introduction.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1581, doi. 10.1017/S0960129516000189
- By:
- Publication type:
- Article
5
Towards a descriptive theory of cb<sub>0</sub>-spaces.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1553, doi. 10.1017/S0960129516000177
- By:
- Publication type:
- Article
6
On naturally continuous non-dcpo domains.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1521, doi. 10.1017/S0960129516000165
- By:
- Publication type:
- Article
7
Effective Riemann mappings of multiply connected domains and Riemann surfaces.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1495, doi. 10.1017/S0960129516000153
- By:
- Publication type:
- Article
8
Computable elements and functions in effectively enumerable topological spaces.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1466, doi. 10.1017/S0960129516000141
- By:
- Publication type:
- Article
9
A comparison of concepts from computable analysis and effective descriptive set theory.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1414, doi. 10.1017/S0960129516000128
- By:
- Publication type:
- Article
10
Computation over algebraic structures and a classification of undecidable problems.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1386, doi. 10.1017/S0960129516000116
- By:
- Publication type:
- Article
11
A realizability interpretation of Church's simple theory of types.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1364, doi. 10.1017/S0960129516000104
- By:
- Publication type:
- Article
12
On computability and disintegration.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1287, doi. 10.1017/S0960129516000098
- By:
- Publication type:
- Article
13
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1285, doi. 10.1017/S0960129516000086
- By:
- Publication type:
- Article
14
On the computational complexity of the Dirichlet Problem for Poisson's Equation.
- Published in:
- Mathematical Structures in Computer Science, 2017, v. 27, n. 8, p. 1437, doi. 10.1017/S096012951600013X
- By:
- Publication type:
- Article