Published in: LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
Rupert Hölzl, Philip Janicki, Wolfgang Merkle, and Frank Stephan. Randomness Versus Superspeedability. In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{holzl_et_al:LIPIcs.MFCS.2024.62, author = {H\"{o}lzl, Rupert and Janicki, Philip and Merkle, Wolfgang and Stephan, Frank}, title = {{Randomness Versus Superspeedability}}, booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-335-5}, ISSN = {1868-8969}, year = {2024}, volume = {306}, editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.62}, URN = {urn:nbn:de:0030-drops-206187}, doi = {10.4230/LIPIcs.MFCS.2024.62}, annote = {Keywords: superspeedable numbers, speedable numbers, regainingly approximable numbers, regular numbers, left-computable numbers} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Djamel Eddine Amir and Mathieu Hoyrup. Computability of Finite Simplicial Complexes. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 111:1-111:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amir_et_al:LIPIcs.ICALP.2022.111, author = {Amir, Djamel Eddine and Hoyrup, Mathieu}, title = {{Computability of Finite Simplicial Complexes}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {111:1--111:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.111}, URN = {urn:nbn:de:0030-drops-164522}, doi = {10.4230/LIPIcs.ICALP.2022.111}, annote = {Keywords: Computable Type, Simplicial Complex, Surjection Property, Topological Cone, Absolute Neighborhood Retract, Dunce Hat, Bing’s House} }
Published in: Dagstuhl Reports, Volume 11, Issue 10 (2022)
Mathieu Hoyrup, Arno Pauly, Victor Selivanov, and Mariya I. Soskova. Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). In Dagstuhl Reports, Volume 11, Issue 10, pp. 72-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{hoyrup_et_al:DagRep.11.10.72, author = {Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.}, title = {{Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461)}}, pages = {72--93}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {11}, number = {10}, editor = {Hoyrup, Mathieu and Pauly, Arno and Selivanov, Victor and Soskova, Mariya I.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.10.72}, URN = {urn:nbn:de:0030-drops-159293}, doi = {10.4230/DagRep.11.10.72}, annote = {Keywords: computable analysis, enumeration degrees, quasi-polish spaces, synthetic topology} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Mathieu Hoyrup. Descriptive Complexity on Non-Polish Spaces II. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 132:1-132:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hoyrup:LIPIcs.ICALP.2020.132, author = {Hoyrup, Mathieu}, title = {{Descriptive Complexity on Non-Polish Spaces II}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {132:1--132:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.132}, URN = {urn:nbn:de:0030-drops-125395}, doi = {10.4230/LIPIcs.ICALP.2020.132}, annote = {Keywords: Represented space, Computable analysis, Descriptive set theory, Scott topology} }
Published in: LIPIcs, Volume 154, 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
Antonin Callard and Mathieu Hoyrup. Descriptive Complexity on Non-Polish Spaces. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{callard_et_al:LIPIcs.STACS.2020.8, author = {Callard, Antonin and Hoyrup, Mathieu}, title = {{Descriptive Complexity on Non-Polish Spaces}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.8}, URN = {urn:nbn:de:0030-drops-118694}, doi = {10.4230/LIPIcs.STACS.2020.8}, annote = {Keywords: Represented space, Computable analysis, Descriptive set theory, CoPolish spaces} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Mathieu Hoyrup and Donald M. Stull. Semicomputable Points in Euclidean Spaces. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 48:1-48:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hoyrup_et_al:LIPIcs.MFCS.2019.48, author = {Hoyrup, Mathieu and Stull, Donald M.}, title = {{Semicomputable Points in Euclidean Spaces}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.48}, URN = {urn:nbn:de:0030-drops-109928}, doi = {10.4230/LIPIcs.MFCS.2019.48}, annote = {Keywords: Semicomputable point, Left-c.e. real, Convex cone, Solovay reducibility, Genericity} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Mathieu Hoyrup, Diego Nava Saucedo, and Don M. Stull. Semicomputable Geometry. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 129:1-129:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hoyrup_et_al:LIPIcs.ICALP.2018.129, author = {Hoyrup, Mathieu and Nava Saucedo, Diego and Stull, Don M.}, title = {{Semicomputable Geometry}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {129:1--129:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.129}, URN = {urn:nbn:de:0030-drops-91336}, doi = {10.4230/LIPIcs.ICALP.2018.129}, annote = {Keywords: Computable set, Semicomputable set, Solovay reducibility, Left-ce real, Genericity} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Mathieu Hoyrup. The Decidable Properties of Subrecursive Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 108:1-108:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hoyrup:LIPIcs.ICALP.2016.108, author = {Hoyrup, Mathieu}, title = {{The Decidable Properties of Subrecursive Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {108:1--108:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.108}, URN = {urn:nbn:de:0030-drops-62435}, doi = {10.4230/LIPIcs.ICALP.2016.108}, annote = {Keywords: Rice theorem, subrecursive class, decidable property, Kolmogorov complexity, compressibility} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Mathieu Hoyrup and Cristóbal Rojas. On the Information Carried by Programs about the Objects They Compute. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 447-459, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hoyrup_et_al:LIPIcs.STACS.2015.447, author = {Hoyrup, Mathieu and Rojas, Crist\'{o}bal}, title = {{On the Information Carried by Programs about the Objects They Compute}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {447--459}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.447}, URN = {urn:nbn:de:0030-drops-49337}, doi = {10.4230/LIPIcs.STACS.2015.447}, annote = {Keywords: Markov-computable, representation, Kolmogorov complexity, Ershov topology} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Mathieu Hoyrup. Irreversible computable functions. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 362-373, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{hoyrup:LIPIcs.STACS.2014.362, author = {Hoyrup, Mathieu}, title = {{Irreversible computable functions}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {362--373}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.362}, URN = {urn:nbn:de:0030-drops-44712}, doi = {10.4230/LIPIcs.STACS.2014.362}, annote = {Keywords: Computability theory, computable analysis, finite injury, generic set} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Mathieu Hoyrup. The dimension of ergodic random sequences. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 567-576, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{hoyrup:LIPIcs.STACS.2012.567, author = {Hoyrup, Mathieu}, title = {{The dimension of ergodic random sequences}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {567--576}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.567}, URN = {urn:nbn:de:0030-drops-33917}, doi = {10.4230/LIPIcs.STACS.2012.567}, annote = {Keywords: Shannon-McMillan-Breiman theorem, Martin-L\"{o}f random sequence, effective Hausdorff dimension, compression rate, entropy} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Peter Gacs, Mathieu Hoyrup, and Cristobal Rojas. Randomness on Computable Probability Spaces - A Dynamical Point of View. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 469-480, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gacs_et_al:LIPIcs.STACS.2009.1828, author = {Gacs, Peter and Hoyrup, Mathieu and Rojas, Cristobal}, title = {{Randomness on Computable Probability Spaces - A Dynamical Point of View}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {469--480}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1828}, URN = {urn:nbn:de:0030-drops-18280}, doi = {10.4230/LIPIcs.STACS.2009.1828}, annote = {Keywords: Schnorr randomness, Birkhoff's ergodic theorem, Computable measures} }
Feedback for Dagstuhl Publishing