activity
20072026
most citedComputing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

6 citations · 22 across the 17 of their papers we have counts for

collaborators

20 papers

math.DS2026

Computable Ergodic Optimisation

Léopoldine Gayral, Mathieu Hoyrup

Links between physicals systems and computability properties have been an active field of investigation in recent years. Inspired by a previous work in the context of positive temp…

math.GN2023

The surjection property and computable type

Djamel Eddine Amir, Mathieu Hoyrup

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to character…

math.LO2022

Strong computable type

Djamel Eddine Amir, Mathieu Hoyrup

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable…

math.LO2022★ 1 cited

Computability of finite simplicial complexes

Djamel Eddine Amir, Mathieu Hoyrup

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X…

math.LO2019

Computability on quasi-Polish spaces

Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov +1

We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open…

math.LO2017★ 4 cited

Results in descriptive set theory on some represented spaces

Mathieu Hoyrup

Descriptive set theory was originally developed on Polish spaces. It was later extended to -continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 20…