Controlling effective packing dimension of \(\Delta_2^0\) degrees

DOI10.1215/00294527-3328401zbMath1352.03048OpenAlexW2240279767MaRDI QIDQ5963200

Jonathan Stephenson

Publication date: 4 March 2016

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-3328401

zbMATH Keywords

effective packing dimensionlimit-computable approximationpruned clumpy trees

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (1)

AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES

This page was built for publication: Controlling effective packing dimension of \(\Delta_2^0\) degrees