Fetching the paper…
Reading the bibliography…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms.
Grundbegriffe der Wahrscheinlichkeitsrechnung
A. N. Kolmogorov. 1933 · 1933
Earlier work this paper cites.
On Notation for Ordinal Numbers
Stephen Cole Kleene. 1938 · 1938
Earlier work this paper cites.
A formal theory of inductive inference II
R. J. Solomonoff. 1964 · 1964
Earlier work this paper cites.
Trial and error predicates and the solution to a problem of Mostowski
Hilary Putnam. 1965 · 1965
Earlier work this paper cites.
Language identification in the limit
E. Mark Gold. 1967 · 1967
Earlier work this paper cites.
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
A. K. Zvonkin and L. A. Levin. 1970 · 1970
Earlier work this paper cites.
A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
J. Myhill. 1971 · 1971
Earlier work this paper cites.
Probabilistic recursive functions
Irwin Mann. 1973 · 1973
Earlier work this paper cites.
Conditional probability distributions
Tue Tjur. 1974 · 1974
Earlier work this paper cites.
A Constructive definition of conditional distributions
Tue Tjur. 1975 · 1975
Earlier work this paper cites.
The complexity of nonuniform random number generation
Donald E. Knuth and Andrew C. Yao. 1976 · 1976
Earlier work this paper cites.
Conditional distributions as derivatives
J. Pfanzagl. 1979 · 1979
Earlier work this paper cites.
Probability based on Radon measures
Tue Tjur. 1980 · 1980
Earlier work this paper cites.
Average case complete problems
Leonid A. Levin. 1986 · 1986
Earlier work this paper cites.
Theory of recursive functions and effective computability (2nd ed.)
Hartley Rogers, Jr. 1987 · 1987
Earlier work this paper cites.
Mechanical learners pay a price for Bayesianism
Daniel N. Osherson, Michael Stob, and Scott Weinstein. 1988 · 1988
Earlier work this paper cites.
Paradoxes in conditional probability
M. M. Rao. 1988 · 1988
Earlier work this paper cites.
Computability in analysis and physics
Marian B. Pour-El and J. Ian Richards. 1989 · 1989
Earlier work this paper cites.
The computational complexity of probabilistic inference using Bayesian belief networks
Gregory F. Cooper. 1990 · 1990
Earlier work this paper cites.
Representing Bayesian networks within probabilistic Horn abduction. In Proc. of the 7th Conf. on Uncertainty in Artificial Intelligence . 271–278
David Poole. 1991 · 1991
Earlier work this paper cites.
On the theory of average case complexity
Shai Ben-David, Benny Chor, Oded Goldreich, and Michael Luby. 1992 · 1992
Earlier work this paper cites.
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Paul Dagum and Michael Luby. 1993 · 1993
Earlier work this paper cites.
Computability on computable metric spaces
Klaus Weihrauch. 1993 · 1993
Cited alongside, same era.
Classical descriptive set theory . Graduate Texts in Mathematics, Vol. 156
Alexander S. Kechris. 1995 · 1995
Cited alongside, same era.
Theory of statistics
Mark J. Schervish. 1995 · 1995
Cited alongside, same era.
The Scott topology induces the weak topology
Abbas Edalat. 1996 · 1996
Cited alongside, same era.
Domain representability of metric spaces
Jens Blanck. 1997 · 1997
Cited alongside, same era.
An optimal approximation algorithm for Bayesian inference
Paul Dagum and Michael Luby. 1997 · 1997
Cited alongside, same era.
A computational model for metric spaces
Notions of probabilistic computability on represented spaces
Volker Bosserhoff. 2008 · 2008
Later among the works it cites.
Church: a language for generative models. In Proc. of the 24th Conf. on Uncertainty in Artificial Intelligence
Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, and Joshua B. Tenenbaum. 2008 · 2008
Later among the works it cites.
Computability, Randomness and Ergodic Theory on Metric Spaces
Mathieu Hoyrup. 2008 · 2008
Later among the works it cites.
A probabilistic language based on sampling functions
Sungwoo Park, Frank Pfenning, and Sebastian Thrun. 2008 · 2008
Later among the works it cites.
On a definition of random sequences with respect to conditional probability
Hayato Takahashi. 2008 · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Abbas Edalat and Reinhold Heckmann. 1998 · 1998
Cited alongside, same era.
Computability on random variables
Norbert Th. Müller. 1999 · 1999
Cited alongside, same era.
Computability on the probability measures on the Borel sets of the unit interval
Klaus Weihrauch. 1999 · 1999
Cited alongside, same era.
Polynomial time samplable distributions
Tomoyuki Yamakami. 1999 · 1999
Cited alongside, same era.
Computable analysis: an introduction
Klaus Weihrauch. 2000 · 2000
Cited alongside, same era.
IBAL: A probabilistic rational programming language. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence . Morgan Kaufmann Publ., 733–740
Avi Pfeffer. 2001 · 2001
Cited alongside, same era.
Computable exchangeable sequences have computable de Finetti measures. In Mathematical Theory and Computational Practice (CiE 2009), Proc. of the 5th Conf. on Computability in Europe (Lecture Notes in Comput. Sci.) , Klaus Ambos-Spies, Benedikt Löwe, and Wolfgang Merkle (Eds.), Vol. 5635. Springer, 218–231
Cameron E. Freer and Daniel M. Roy. 2009 · 2009
Later among the works it cites.
Computability of probability measures and Martin-Löf randomness over metric spaces
Mathieu Hoyrup and Cristóbal Rojas. 2009b · 2009
Later among the works it cites.
Embedded probabilistic programming. In Domain-Specific Languages (Lecture Notes in Computer Science) , Walid Mohamed Taha (Ed.), Vol. 5658. Springer, 360–384
Oleg Kiselyov and Chung-chieh Shan. 2009 · 2009
Later among the works it cites.
Descriptive set theory (2nd ed.). Mathematical Surveys and Monographs, Vol. 155
Yiannis N. Moschovakis. 2009 · 2009
Later among the works it cites.
Computability and randomness . Oxford Logic Guides, Vol. 51
André Nies. 2009 · 2009
Later among the works it cites.
On the computability of conditional probability. (2010)
Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy. 2010 · 2010
Closest in time.
Posterior distributions are computable from predictive distributions. In Proc. of the 13th Int. Conf. on Artificial Intelligence and Statistics (AISTATS 2010) (Y. W. Teh and M. Titterington, eds.), JMLR: W&CP 9 . 233–240
Cameron E. Freer and Daniel M. Roy. 2010 · 2010
Closest in time.
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Stefano Galatolo, Mathieu Hoyrup, and Cristóbal Rojas. 2010 · 2010
Closest in time.
Infer.NET 2.4
T. Minka, J.M. Winn, J.P. Guiver, and D.A. Knowles. 2010 · 2010
Closest in time.
Noncomputable conditional distributions. In Proc. of the 26th Ann. IEEE Symp. on Logic in Comput. Sci. (LICS 2011) . IEEE Computer Society, 107–116
Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy. 2011 · 2011
Closest in time.
Absolute continuity of measures and preservation of randomness. (2011)
Mathieu Hoyrup and Cristobal Rojas. 2011 · 2011
Closest in time.
Computability of the Radon-Nikodym derivative. In Models of Computation in Context, Proc. of the 7th Conf. on Computability in Europe (CiE 2011) (Lecture Notes in Comput. Sci.) , Benedikt Löwe, Dag Normann, Ivan N. Soskov, and Alexandra A. Soskova (Eds.), Vol. 6735. Springer, 132–141
Mathieu Hoyrup, Cristobal Rojas, and Klaus Weihrauch. 2011 · 2011
Closest in time.
Computability, inference and modeling in probabilistic programming
Daniel M. Roy. 2011 · 2011
Closest in time.
Computable de Finetti measures
Cameron E. Freer and Daniel M. Roy. 2012 · 2012
Closest in time.
Continuity on a measure one set versus measure one set of points of continuity
François G. Dorais, Gerald Edgar, and Jason Rute. 2013 · 2013
Closest in time.
L 1 L^{1} -computability, layerwise computability and Solovay reducibility
Kenshi Miyabe. 2013 · 2013
Closest in time.