Degrees of random sets

Steven M. Kautz

Type: Book

Publication Date: 1991-01-01

Citations: 99

Similar Works

Action	Title	Year	Authors
+	Random sets	2008	Hung T. Nguyen
+	Random Sets	1997	John Goutsias Ronald Mahler Hung T. Nguyen
+	Random Sets	2002
+	Theory of Random Sets	2005	Ilya Molchanov
+	Finite Random Sets	1997	I. R. Goodman Ronald Mahler Hung T. Nguyen
+	Expectations of Random Sets	2005
+	Random Sets and Random Functions	2005
+	Degrees of computability and randomness	2009	Anthony Morphett
+	Random partitions of sets	1997	Vladimir N. Sachkov
+	Random Set	2020
+	Random orders	1985	Peter Winkler
+	Random Closed Sets	2007	Ilya Molchanov
+	Random fields	2019	E Weinan Tiejun Li Eric Vanden‐Eijnden
+	Perfect sets of random reals	1993	Jörg Brendle Haim Judah
+	Ratio sets of random sets	2015	Javier Cilleruelo Jorge Guijarro-Ordóñez
+	Distributions of random sets and random selections	1983	Zvi Artstein
+	Random Sets (in Particular Boolean Models)	2006	Wolfgang Weil
+ PDF Chat	Quasi-Random Set Systems	1991	Frank R. Chung R. L. Graham
+	Degree sequences of random graphs	1981	Béla Bollobás
+	Theory of Random Sets	2017	Ilya Molchanov

Action	Title	Year	Authors
+ PDF Chat	Randomness for computable measures and initial segment complexity	2016	Rupert Hölzl Christopher P. Porter
+ PDF Chat	Effective randomness for continuous measures	2021	Jan Reimann Theodore A. Slaman
+	The Information Content of Typical Reals	2015	George Barmpalias Andy Lewis-Pye
+	Lowness and nullsets	2006	Rod Downey André Nies Rebecca Weber Liang Yu
+ PDF Chat	On a conjecture of Dobrinen and Simpson concerning almost everywhere domination	2006	Stephen Binns Bjørn Kjos-Hanssen Manuel Lerman Reed Solomon
+	On the close interaction between algorithmic randomness and constructive/computable measure theory	2018	Jason Rute
+	Relationships between computability-theoretic properties of problems	2019	Rod Downey Noam Greenberg Matthew Harrison‐Trainor Ludovic Patey Dan Turetsky
+	The typical Turing degree	2011	George Barmpalias Adam R. Day Andrew E. M. Lewis
+	Independence Properties of Algorithmically Random Sequences	2003	Steven M. Kautz
+	Strong reductions in effective randomness	2012	Laurent Bienvenu Christopher P. Porter

Action	Title	Year	Authors
+	Randomness and generalizations of fixed point free functions	1990	Antonín Kučera
+	On the Notion of Randomness	1970	Per Martin-Löf
+ PDF Chat	Some applications of the notions of forcing and generic sets	1964	Solomon Feferman
+	A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable	1970	Robert M Solovay
+	Measure and minimal degrees	1977	J. B. Paris
+	The definition of random sequences	1966	Per Martin-Löf
+	On the notion of infinite pseudorandom sequences	1986	Ker‐I Ko
+	Automorphism bases for degrees of unsolvability	1981	Carl G. Jockusch David B. Posner
+	Forcing and reducibilities	1983	Piergiorgio Odifreddi
+	Almost everywhere high nonuniform complexity	1992	Jack H. Lutz