Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Complexity of Recursive Splittings of Random Sets

From MaRDI portal
Publication:4979763
Jump to:navigation, search

DOI10.3233/COM-14023zbMath1338.03085OpenAlexW1743636081MaRDI QIDQ4979763

Keng Meng Ng, André Nies, Frank Stephan

Publication date: 19 June 2014

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-14023


zbMATH Keywords

splittingcomputabilityalgorithmic randomness


Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4979763&oldid=19419812"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 10:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki