Matthias Schröder

CoRR, 2020

Overt choice.

[BibT_eX]

[DOI]

Matthew de Brecht

Arno Pauly

Comput., 2020

2019

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

[BibT_eX]

[DOI]

CoRR, 2019

Selection of equipment modules for a flexible modular production plant by a multi-objective evolutionary algorithm.

[BibT_eX]

[DOI]

Comput. Chem. Eng., 2019

2017

Addendum to: "The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma" [Ann. Pure Appl. Logic 163 (6) (2012) 623-655].

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

Bounded time computation on metric spaces and Banach spaces.

[BibT_eX]

[DOI]

Florian Steinberg

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Base-complexity classifications of qcb0-spaces1.

[BibT_eX]

[DOI]

Matthew de Brecht

Comput., 2016

2015

Some hierarchies of QCB 0-spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Observationally-induced lower and upper powerspace constructions.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2015

Hyperprojective hierarchy of qcb0-spaces.

[BibT_eX]

[DOI]

Comput., 2015

Average-Case Bit-Complexity Theory of Real Functions.

[BibT_eX]

[DOI]

Florian Steinberg

Martin Ziegler

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Base-Complexity Classifications of QCB0-Spaces.

[BibT_eX]

[DOI]

Matthew de Brecht

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2011

Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

2010

A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

ℕℕℕ does not satisfy Normann's condition

[BibT_eX]

[DOI]

CoRR, 2010

2009

The sequential topology on ℕℕℕ is not regular.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

An Effective Tietze-Urysohn Theorem for QCB-Spaces.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2009

A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

Editorial: Math. Log. Quart. 5/2008.

[BibT_eX]

[DOI]

Math. Log. Q., 2008

On the Relationship between Filter Spaces and Weak Limit Spaces.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

Computability and Complexity in Analysis.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Two preservation results for countable products of sequential spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2007

Computable metrization.

[BibT_eX]

[DOI]

Tanja Grubba

Klaus Weihrauch

Math. Log. Q., 2007

A Convenient Category of Domains.

[BibT_eX]

[DOI]

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2006

Compactly generated domain theory.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

Representing probability measures using probabilistic processes.

[BibT_eX]

[DOI]

J. Complex., 2006

Admissible Representations of Probability Measures.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Admissible Representations in Computable Analysis.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Probabilistic Observations and Valuations: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Computing with Sequences, Weak Topologies and the Axiom of Choice.

[BibT_eX]

[DOI]

Vasco Brattka

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004

Spaces allowing Type-2 Complexity Theory revisited.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory.

[BibT_eX]

[DOI]

Daren Kunkle

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

2003

Admissible representations for continuous computations.

[BibT_eX]

[DOI]

PhD thesis, 2003

2002

Extended admissibility.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Effectivity in Spaces with Admissible Multirepresentations.

[BibT_eX]

[DOI]

Math. Log. Q., 2002

A Natural Weak Limit Space with Admissible Representation which is not a Limit Space.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

Preface.

[BibT_eX]

[DOI]

Vasco Brattka

Klaus Weihrauch

Proceedings of the Computability and Complexity in Analysis, 2002

2000

Admissible Representations of Limit Spaces.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

Online Computations of Differentiable Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1997

Fast Online Multiplication of Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996

Fast Online Real Multiplication.

[BibT_eX]