scientific article; zbMATH DE number 7311154
From MaRDI portal
Publication:5150976
zbMATH Open1456.03062MaRDI QIDQ5150976
Publication date: 16 February 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?CCA2010.11
Title of this publication is not available (Why is that?)
Theory of numerations, effectively presented structures (03D45) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items (1)
Recommendations
- Title not available (Why is that?) π π
- Effectively closed sets of measures and randomness π π
- Higher randomness and forcing with closed sets π π
- Compactness arguments with effectively closed sets for the study of relative randomness π π
- Algorithmically Random Functions and Effective Capacities π π
- Algorithmic Randomness and Capacity of Closed Sets π π
- The Intersection of Algorithmically Random Closed Sets and Effective Dimension π π
- On the construction of effectively random sets π π
- Logical Approaches to Computational Barriers π π
- Perronβs capacity of random sets π π
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150976)