Matthew de Brecht

According to our database, Matthew de Brecht authored at least 27 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Ideal presentations and numberings of some classes of effective quasi-Polish spaces.

Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov

Comput., 2024

2022

Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals.

Matthew de Brecht

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

Enumerating Classes of Effective Quasi-Polish Spaces.

Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov

Proceedings of the Revolutions and Revelations in Computability, 2022

2020

Overt choice.

Matthew de Brecht, Arno Pauly, Matthias Schröder

Comput., 2020

Some Notes on Spaces of Ideals and Computable Topology.

Matthew de Brecht

Proceedings of the Beyond the Horizon of Computability, 2020

2019

On the commutativity of the powerspace constructions.

Matthew de Brecht, Tatsuji Kawai

Log. Methods Comput. Sci., 2019

Domain-complete and LCS-complete Spaces.

Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia, Zhenchao Lyu

Proceedings of the 8th International Symposium on Domain Theory and Its Applications, 2019

2018

A generalization of a theorem of Hurewicz for quasi-Polish spaces.

Matthew de Brecht

Log. Methods Comput. Sci., 2018

2017

Noetherian Quasi-Polish spaces.

Matthew de Brecht, Arno Pauly

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Base-complexity classifications of qcb0-spaces1.

Matthew de Brecht, Matthias Schröder, Victor L. Selivanov

Comput., 2016

2015

Descriptive Set Theory in the Category of Represented Spaces.

Arno Pauly, Matthew de Brecht

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Base-Complexity Classifications of QCB₀-Spaces.

Matthew de Brecht, Matthias Schröder, Victor L. Selivanov

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

2014

Levels of discontinuity, limit-computability, and jump operators.

Matthew de Brecht

Proceedings of the Logic, Computation, Hierarchies, 2014

2013

Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces.

Arno Pauly, Matthew de Brecht

CoRR, 2013

Levels of discontinuity, limit-computability, and jump operators.

Matthew de Brecht

CoRR, 2013

Quasi-Polish spaces.

Matthew de Brecht

Ann. Pure Appl. Log., 2013

2012

Combining sparseness and smoothness improves classification accuracy and interpretability.

Matthew de Brecht, Noriko Yamagishi

NeuroImage, 2012

Non-deterministic computation and the Jayne-Rogers Theorem.

Arno Pauly, Matthew de Brecht

Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

Closed choice and a Uniform Low Basis Theorem.

Vasco Brattka, Matthew de Brecht, Arno Pauly

Ann. Pure Appl. Log., 2012

2010

Topological and algebraic aspects of algorithmic learning theory.

Matthew de Brecht

PhD thesis, 2010

Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data.

Matthew de Brecht, Akihiro Yamamoto

Theor. Comput. Sci., 2010

Topological properties of concept spaces (full version).

Matthew de Brecht, Akihiro Yamamoto

Inf. Comput., 2010

2009

Sigma^0_alpha - Admissible Representations (Extended Abstract).

Matthew de Brecht, Akihiro Yamamoto

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

2008

Topological Properties of Concept Spaces.

Matthew de Brecht, Akihiro Yamamoto

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2006

A neural network implementation of a saliency map model.

Matthew de Brecht, Jun Saiki

Neural Networks, 2006

Inferability of Closed Set Systems from Positive Data.

Matthew de Brecht, Masanori Kobayashi, Hiroo Tokunaga, Akihiro Yamamoto

Proceedings of the New Frontiers in Artificial Intelligence, 2006

Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data.

Matthew de Brecht, Akihiro Yamamoto

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006