David Diamondstone

Generating author description...

All published works

Action	Title	Year	Authors
+	Limit computability and ultrafilters	2023	Uri Andrews Mingzhong Cai David Diamondstone Noah Schweber
+	Asymptotic density, computable traceability, and 1-randomness	2016	Uri Andrews Mingzhong Cai David Diamondstone Carl G. Jockusch Steffen Lempp
+ PDF Chat	On the structure of the degrees of relative provability	2015	Uri Andrews Mingzhong Cai David Diamondstone Steffen Lempp Joseph S. Miller
+	Inherent enumerability of strong jump-traceability	2014	David Diamondstone Noam Greenberg Daniel Turetsky
+	A van Lambalgen theorem for Demuth randomness	2013	David Diamondstone Noam Greenberg Dan Turetsky
+	Natural Large Degree Spectra	2013	David Diamondstone Noam Greenberg Daniel Turetsky
+	Low upper bounds in the LR degrees	2011	David Diamondstone
+	Inherent enumerability of strong jump-traceability	2011	David Diamondstone Noam Greenberg Daniel Turetsky
+	Martin-Löf randomness and Galton–Watson processes	2011	David Diamondstone Bjørn Kjos-Hanssen
+	Strengthening prompt simplicity	2011	David Diamondstone Keng Meng Ng
+	On properties related to k-triviality	2011	Robert I. Soare Denis R. Hirschfeldt David Diamondstone
+	Inherent enumerability of strong jump-traceability	2011	David Diamondstone Noam Greenberg Daniel Turetsky
+ PDF Chat	Π 1 0 Classes, Peano Arithmetic, Randomness, and Computable Domination	2010	David Diamondstone Damir D. Dzhafarov Robert I. Soare
+ PDF Chat	Members of Random Closed Sets	2009	David Diamondstone Bjørn Kjos-Hanssen

Common Coauthors

Coauthor	Papers Together
Noam Greenberg	5
Daniel Turetsky	4
Uri Andrews	3
Mingzhong Cai	3
Bjørn Kjos-Hanssen	2
Robert I. Soare	2
Steffen Lempp	2
Damir D. Dzhafarov	1
Carl G. Jockusch	1
Denis R. Hirschfeldt	1
Dan Turetsky	1
Noah Schweber	1
Keng Meng Ng	1
Joseph S. Miller	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Lowness properties and randomness	2004	André Nies	4
+	Using random sets as oracles	2007	Denis R. Hirschfeldt André Nies Frank Stephan	3
+ PDF Chat	Lowness properties and approximations of the jump	2008	Santiago Figueira André Nies Frank Stephan	3
+	Computational randomness and lowness	2001	Sebastiaan A. Terwijn Domenico Zambella	3
+ PDF Chat	Effectively closed sets of measures and randomness	2008	Jan Reimann	2
+	Strong jump-traceability I: The computably enumerable case	2007	Peter Cholak Rod Downey Noam Greenberg	2
+	TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES	2007	Rod Downey Noam Greenberg Rebecca Weber	2
+ PDF Chat	Strong jump-traceability and Demuth randomness	2013	Noam Greenberg Daniel Turetsky	2
+	Effective Hausdorff dimension	2017	Jan Reimann Frank Stephan	2
+	Time-Bounded Kolmogorov Complexity and Solovay Functions	2009	Rupert Hölzl Thorsten Kräling Wolfgang Merkle	2
+	Randomness and Computability: Open Questions	2006	Joseph S. Miller André Nies	2
+ PDF Chat	Effective dimension of points visited by Brownian motion	2008	Bjørn Kjos-Hanssen Anil Nerode	2
+	Trees Generated by a Simple Branching Process	1981	John Hawkes	2
+ PDF Chat	Infinite Subsets of Random Sets of Integers	2009	Bjørn Kjos-Hanssen	2
+	On strongly jump traceable reals	2008	Keng Meng Ng	2
+	Geometry of Sets and Measures in Euclidean Spaces	1995	Pertti Mattila	2
+ PDF Chat	Random Walks and Percolation on Trees	1990	Russell Lyons	2
+ PDF Chat	An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees	1984	Klaus Ambos–Spies Carl G. Jockusch Richard A. Shore Robert I. Soare	2
+	A mathematical proof of S. Shelah’s theorem on the measure problem and related results	1984	Jean Raisonnier	2
+ PDF Chat	Degrees of members of Π<sub>1</sub><sup>0</sup>classes	1972	Carl G. Jockusch Robert I. Soare	1
+	Schnorr trivial sets and truth-table reducibility	2010	Johanna N. Y. Franklin Frank Stephan	1
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>Π</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup></mml:math> classes, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi><mml:mi>R</mml:mi></mml:math> degrees and Turing degrees	2008	George Barmpalias Andrew E. M. Lewis Frank Stephan	1
+	Members of countable π10 classes	1986	Douglas Cenzer Peter Clote Rick L. Smith Robert I. Soare Stanley S. Wainer	1
+	Introduction to Probability Theory.	1972	H. C. Fryer Paul G. Hoel Sidney C. Port Charles Leonard Stone	1
+ PDF Chat	Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets	1983	Wolfgang Maass	1
+	Dynamics of a generic Brownian motion: Recursive aspects	2008	Willem L. Fouché	1
+ PDF Chat	Recursively enumerable sets of positive integers and their decision problems	1944	Emil L. Post	1
+ PDF Chat	Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees	2009	George Barmpalias Rod Downey Noam Greenberg	1
+	On the relation between descriptional complexity and algorithmic probability	1983	Péter Gács	1
+	The K-Degrees, Low for K Degrees,and Weakly Low for K Sets	2009	Joseph S. Miller	1
+	Kolmogorov–Loveland randomness and stochasticity	2005	Wolfgang Merkle Joseph S. Miller André Nies Jan Reimann Frank Stephan	1
+	Randomness, relativization and Turing degrees	2005	André Nies Frank Stephan Sebastiaan A. Terwijn	1
+ PDF Chat	Randomness via effective descriptive set theory	2007	Greg Hjorth André Nies	1
+ PDF Chat	Truth-table Schnorr randomness and truth-table reducible randomness	2011	Kenshi Miyabe	1
+	Accessible Independence Results for Peano Arithmetic	1982	Laurie Kirby J. B. Paris	1
+ PDF Chat	Covering the Recursive Sets	2015	Bjørn Kjos-Hanssen Frank Stephan Sebastiaan A. Terwijn	1
+ PDF Chat	Lowness notions, measure and domination	2012	Bjørn Kjos-Hanssen Joseph S. Miller Reed Solomon	1
+	Almost computably enumerable families of sets	2008	I. Sh. Kalimullin	1
+ PDF Chat	Members of Random Closed Sets	2009	David Diamondstone Bjørn Kjos-Hanssen	1
+	Low upper bounds of ideals	2009	Antonín Kučera Theodore A. Slaman	1
+	An almost deep degree	2001	Peter Cholak Marcia J. Groszek Theodore A. Slaman	1
+	COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS	2014	Laurent Bienvenu Adam R. Day Noam Greenberg Antonín Kučera Joseph S. Miller André Nies Dan Turetsky	1
+	Almost everywhere domination and superhighness	2007	Stephen G. Simpson	1
+	Notions of weak genericity	1983	Stuart A. Kurtz	1
+ PDF Chat	From Bi-Immunity to Absolute Undecidability	2009	Laurent Bienvenu Adam R. Day Rupert Hölzl	1
+ PDF Chat	Strong jump-traceability II: K-triviality	2011	Rod Downey Noam Greenberg	1
+	A minimal pair of Π<sub>1</sub><sup>0</sup> classes	1971	Carl G. Jockusch Robert I. Soare	1
+	Algorithmically random closed sets and probability	2010	Peter Cholak Logan Axon	1
+ PDF Chat	Relations between varieties of kolmogorov complexities	1996	Vladimir Uspensky Alexander Shen	1
+ PDF Chat	ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS	2013	Rodney G. Downey Carl G. Jockusch Paul E. Schupp	1