No. Title Author Year
1 Computability of Finite Simplicial Complexes Amir, Djamel Eddine et al. 2022
2 Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461) Hoyrup, Mathieu et al. 2022
3 Descriptive Complexity on Non-Polish Spaces Callard, Antonin et al. 2020
4 Descriptive Complexity on Non-Polish Spaces II Hoyrup, Mathieu 2020
5 Semicomputable Points in Euclidean Spaces Hoyrup, Mathieu et al. 2019
6 Semicomputable Geometry Hoyrup, Mathieu et al. 2018
7 The Decidable Properties of Subrecursive Functions Hoyrup, Mathieu 2016
8 On the Information Carried by Programs about the Objects They Compute Hoyrup, Mathieu et al. 2015
9 Irreversible computable functions Hoyrup, Mathieu 2014
10 The dimension of ergodic random sequences Hoyrup, Mathieu 2012
11 Randomness on Computable Probability Spaces - A Dynamical Point of View Gacs, Peter et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 11

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI