![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Matthew de Brecht
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
- [b1]Matthew de Brecht:
Topological and algebraic aspects of algorithmic learning theory. Kyoto University, Japan, 2010
Journal Articles
- 2020
- [j9]Matthew de Brecht, Arno Pauly, Matthias Schröder
:
Overt choice. Comput. 9(3-4): 169-191 (2020) - 2019
- [j8]Matthew de Brecht, Tatsuji Kawai:
On the commutativity of the powerspace constructions. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [j7]Matthew de Brecht:
A generalization of a theorem of Hurewicz for quasi-Polish spaces. Log. Methods Comput. Sci. 14(1) (2018) - 2013
- [j6]Matthew de Brecht:
Quasi-Polish spaces. Ann. Pure Appl. Log. 164(3): 356-381 (2013) - 2012
- [j5]Vasco Brattka
, Matthew de Brecht, Arno Pauly
:
Closed choice and a Uniform Low Basis Theorem. Ann. Pure Appl. Log. 163(8): 986-1008 (2012) - [j4]Matthew de Brecht, Noriko Yamagishi:
Combining sparseness and smoothness improves classification accuracy and interpretability. NeuroImage 60(2): 1550-1561 (2012) - 2010
- [j3]Matthew de Brecht, Akihiro Yamamoto:
Topological properties of concept spaces (full version). Inf. Comput. 208(4): 327-340 (2010) - [j2]Matthew de Brecht, Akihiro Yamamoto:
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data. Theor. Comput. Sci. 411(7-9): 976-985 (2010) - 2006
- [j1]Matthew de Brecht, Jun Saiki
:
A neural network implementation of a saliency map model. Neural Networks 19(10): 1467-1474 (2006)
Conference and Workshop Papers
- 2022
- [c12]Matthew de Brecht, Takayuki Kihara
, Victor L. Selivanov
:
Enumerating Classes of Effective Quasi-Polish Spaces. CiE 2022: 88-102 - [c11]Matthew de Brecht:
Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals. CSL 2022: 9:1-9:10 - 2020
- [c10]Matthew de Brecht:
Some Notes on Spaces of Ideals and Computable Topology. CiE 2020: 26-37 - 2019
- [c9]Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia
, Zhenchao Lyu
:
Domain-complete and LCS-complete Spaces. ISDT 2019: 3-35 - 2017
- [c8]Matthew de Brecht, Arno Pauly
:
Noetherian Quasi-Polish spaces. CSL 2017: 16:1-16:17 - 2015
- [c7]Matthew de Brecht, Matthias Schröder
, Victor L. Selivanov:
Base-Complexity Classifications of QCB0-Spaces. CiE 2015: 156-166 - [c6]Arno Pauly
, Matthew de Brecht:
Descriptive Set Theory in the Category of Represented Spaces. LICS 2015: 438-449 - 2012
- [c5]Arno Pauly
, Matthew de Brecht:
Non-deterministic computation and the Jayne-Rogers Theorem. DCM 2012: 87-96 - 2009
- [c4]Matthew de Brecht, Akihiro Yamamoto:
Sigma^0_alpha - Admissible Representations (Extended Abstract). CCA 2009 - 2008
- [c3]Matthew de Brecht, Akihiro Yamamoto:
Topological Properties of Concept Spaces. ALT 2008: 374-388 - 2006
- [c2]Matthew de Brecht, Akihiro Yamamoto:
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data. ALT 2006: 124-138 - [c1]Matthew de Brecht, Masanori Kobayashi, Hiroo Tokunaga, Akihiro Yamamoto:
Inferability of Closed Set Systems from Positive Data. JSAI 2006: 265-275
Parts in Books or Collections
- 2014
- [p1]Matthew de Brecht:
Levels of discontinuity, limit-computability, and jump operators. Logic, Computation, Hierarchies 2014: 79-108
Informal and Other Publications
- 2023
- [i10]Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Ideal presentations and numberings of some classes of effective quasi-Polish spaces. CoRR abs/2301.08469 (2023) - 2021
- [i9]Matthew de Brecht:
Constructing the space of valuations of a quasi-Polish space as a space of ideals. CoRR abs/2106.15780 (2021) - 2019
- [i8]Matthew de Brecht, Arno Pauly, Matthias Schröder:
Overt choice. CoRR abs/1902.05926 (2019) - 2017
- [i7]Matthew de Brecht, Tatsuji Kawai:
On the commutativity of the powerspace constructions. CoRR abs/1709.06226 (2017) - [i6]Matthew de Brecht:
A generalization of a theorem of Hurewicz for quasi-Polish spaces. CoRR abs/1711.09326 (2017) - 2016
- [i5]Matthew de Brecht, Arno Pauly:
Noetherian Quasi-Polish Spaces. CoRR abs/1607.07291 (2016) - 2013
- [i4]Arno Pauly, Matthew de Brecht:
Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces. CoRR abs/1307.1850 (2013) - [i3]Matthew de Brecht:
Levels of discontinuity, limit-computability, and jump operators. CoRR abs/1312.0697 (2013) - 2011
- [i2]Matthew de Brecht:
Quasi-Polish Spaces. CoRR abs/1108.1445 (2011) - 2010
- [i1]Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed Choice and a Uniform Low Basis Theorem. CoRR abs/1002.2800 (2010)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint