| Publication | Date of Publication | Type |
|---|
Comparing computability in two topologies
Journal of Symbolic Logic | 2024-11-25 | Paper |
The surjection property and computable type
Topology and its Applications | 2024-08-23 | Paper |
Computability of finite simplicial complexes
| 2024-06-24 | Paper |
Notes on overt choice
Computability | 2024-01-31 | Paper |
Strong computable type
Computability | 2023-11-30 | Paper |
The surjection property and computable type
| 2023-06-26 | Paper |
Descriptive complexity on non-Polish spaces
| 2023-02-07 | Paper |
Degrees of non-computability of homeomorphism types of Polish spaces
| 2022-12-16 | Paper |
Realizing semicomputable simplices by computable dynamical systems
Theoretical Computer Science | 2022-09-27 | Paper |
scientific article; zbMATH DE number 7561692 (Why is no real title available?)
| 2022-07-21 | Paper |
The fixed-point property for represented spaces
Annals of Pure and Applied Logic | 2022-04-01 | Paper |
Computability of finite simplicial complexes
| 2022-02-10 | Paper |
Computable Measure Theory and Algorithmic Randomness
Theory and Applications of Computability | 2022-01-26 | Paper |
scientific article; zbMATH DE number 7376056 (Why is no real title available?)
| 2021-07-28 | Paper |
scientific article; zbMATH DE number 7311149 (Why is no real title available?)
| 2021-02-16 | Paper |
On the extension of computable real functions
| 2021-01-19 | Paper |
Computability on quasi-Polish spaces
| 2020-05-12 | Paper |
Topological analysis of representations
| 2018-09-06 | Paper |
Layerwise computability and image randomness
Theory of Computing Systems | 2018-02-01 | Paper |
On the information carried by programs about the objects they compute
Theory of Computing Systems | 2018-02-01 | Paper |
The decidable properties of subrecursive functions
| 2017-12-19 | Paper |
Results in descriptive set theory on some represented spaces
| 2017-12-11 | Paper |
Genericity of weakly computable objects
Theory of Computing Systems | 2017-07-17 | Paper |
On the query complexity of real functionals
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
scientific article; zbMATH DE number 6691416 (Why is no real title available?)
| 2017-03-03 | Paper |
On the information carried by programs about the objects they compute
| 2017-01-24 | Paper |
The typical constructible object
Pursuit of the Universal | 2016-08-17 | Paper |
Immune Systems in Computer Virology
Evolving Computability | 2015-10-20 | Paper |
Characterizing polynomial time complexity of stream programs using interpretations
Theoretical Computer Science | 2015-05-26 | Paper |
Algorithmic tests and randomness with respect to a class of measures
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
Analytical properties of resource-bounded real functionals
Journal of Complexity | 2014-07-31 | Paper |
Statistical properties of dynamical systems -- Simulation and abstract computation
Chaos, Solitons and Fractals | 2013-08-07 | Paper |
Computability of the ergodic decomposition
Annals of Pure and Applied Logic | 2013-04-05 | Paper |
Computability of the Radon-Nikodym derivative
Computability | 2013-01-30 | Paper |
The dimension of ergodic random sequences
| 2012-08-23 | Paper |
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation | 2012-05-24 | Paper |
Randomness on computable probability spaces -- a dynamical point of view
| 2012-04-24 | Paper |
Randomness and the ergodic decomposition
Models of Computation in Context | 2011-09-09 | Paper |
Computability of the Radon-Nikodym derivative
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Randomness on computable probability spaces -- a dynamical point of view
Theory of Computing Systems | 2011-05-23 | Paper |
Dynamics and abstract computability: computing invariant measures
Discrete and Continuous Dynamical Systems | 2011-03-07 | Paper |
Interpretation of stream programs: characterizing type 2 polynomial time complexity
Algorithms and Computation | 2010-12-09 | Paper |
An application of Martin-Löf randomness to effective probability theory
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation | 2010-01-12 | Paper |
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation | 2009-07-15 | Paper |
Applications of Effective Probability Theory to Martin-Löf Randomness
Automata, Languages and Programming | 2009-07-14 | Paper |
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Theoretical Computer Science | 2009-05-28 | Paper |
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science | 2008-06-24 | Paper |
Computability of probability measures and Martin-Lof randomness over metric spaces
| 2007-09-06 | Paper |
Dynamical systems: stability and simulability
Mathematical Structures in Computer Science | 2007-06-04 | Paper |
scientific article; zbMATH DE number 2043521 (Why is no real title available?)
| 2004-02-16 | Paper |
Degree spectra of homeomorphism types of compact Polish spaces
| N/A | Paper |
