On the public citation graph
On the Computability of Conditional Probability
0 signed · 101 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/0471742015.scardopenalex-snapshot
Pure and Applied Mathematics
inferredcites →https://doi.org/10.1002/1521-3870(200210)48:1+<131::aid-malq131>3.0.co;2-#openalex-snapshot
Recursive Approximability of Real Numbers
inferredcites →https://doi.org/10.1002/j.1538-7305.1928.tb01236.xopenalex-snapshot
Transmission of Information1
inferredcites →https://doi.org/10.1002/malq.200710010openalex-snapshot
Admissible representations for probability measures
inferredcites →https://doi.org/10.1006/jcom.1999.0523openalex-snapshot
Polynomial Time Samplable Distributions
inferredcites →https://doi.org/10.1007/3-540-63165-8_174openalex-snapshot
Computability on the probability measures on the Borel sets of the unit interval
inferredcites →https://doi.org/10.1007/978-1-4757-4015-8openalex-snapshot
Foundations of Modern Probability
inferredcites →https://doi.org/10.1007/978-3-030-61871-1openalex-snapshot
Foundations of Modern Probability
inferredcites →https://doi.org/10.1007/978-3-642-03034-5_17openalex-snapshot
Embedded Probabilistic Programming
inferredcites →https://doi.org/10.1007/978-3-642-03073-4_23openalex-snapshot
Computable Exchangeable Sequences Have Computable de Finetti Measures
inferredcites →https://doi.org/10.1007/978-3-642-03073-4_27openalex-snapshot
An Application of Martin-Löf Randomness to Effective Probability Theory
inferredcites →https://doi.org/10.1007/978-3-642-49888-6openalex-snapshot
Grundbegriffe der Wahrscheinlichkeitsrechnung
inferredcites →https://doi.org/10.1007/978-3-662-21717-7openalex-snapshot
Computability in Analysis and Physics
inferredcites →https://doi.org/10.1016/0003-4843(79)90021-4openalex-snapshot
A computable ordinary differential equation which possesses no computable solution
inferredcites →https://doi.org/10.1016/0004-3702(90)90060-dopenalex-snapshot
The computational complexity of probabilistic inference using bayesian belief networks
inferredcites →https://doi.org/10.1016/0004-3702(93)90036-bopenalex-snapshot
Approximating probabilistic inference in Bayesian belief networks is NP-hard
inferredcites →https://doi.org/10.1016/0022-0000(92)90019-fopenalex-snapshot
On the theory of average case complexity
inferredcites →https://doi.org/10.1016/0047-259x(88)90140-6openalex-snapshot
Paradoxes in conditional probability
inferredcites →https://doi.org/10.1016/0304-3975(93)90001-aopenalex-snapshot
Computability on computable metric spaces
inferredcites →https://doi.org/10.1016/b978-1-55860-203-8.50039-5openalex-snapshot
Representing Bayesian Networks within Probabilistic Horn Abduction
inferredcites →https://doi.org/10.1016/j.apal.2011.06.011openalex-snapshot
Computable de Finetti measures
inferredcites →https://doi.org/10.1016/j.entcs.2006.08.007openalex-snapshot
Admissible Representations of Probability Measures
inferredcites →https://doi.org/10.1016/j.entcs.2008.03.013openalex-snapshot
Notions of Probabilistic Computability on Represented Spaces
inferredcites →https://doi.org/10.1016/j.ic.2008.08.003openalex-snapshot
On a definition of random sequences with respect to conditional probability
inferredcites →https://doi.org/10.1016/j.ic.2008.12.009openalex-snapshot
Computability of probability measures and Martin-Löf randomness over metric spaces
inferredcites →https://doi.org/10.1016/j.ic.2009.05.001openalex-snapshot
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
inferredcites →https://doi.org/10.1016/j.tcs.2005.03.054openalex-snapshot
Uniform test of algorithmic randomness over a general space
inferredcites →https://doi.org/10.1016/j.tcs.2007.05.016openalex-snapshot
On universal prediction and Bayesian confirmation
inferredcites →https://doi.org/10.1016/s0004-3702(97)00013-1openalex-snapshot
An optimal approximation algorithm for Bayesian inference
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0168-0072(96)00017-6openalex-snapshot
Domain representability of metric spaces
inferredcites →https://doi.org/10.1016/s0168-0072(99)80002-5openalex-snapshot
Mω considered as a programming language
inferredcites →https://doi.org/10.1016/s0304-3975(01)00093-7openalex-snapshot
Effective metric spaces and representations of the reals
inferredcites →https://doi.org/10.1016/s0304-3975(96)00243-5openalex-snapshot
A computational model for metric spaces
inferredcites →https://doi.org/10.1016/s0304-3975(98)00099-1openalex-snapshot
Induction and recursion on the partial real line with applications to Real PCF
inferredcites →https://doi.org/10.1016/s0304-3975(98)00292-8openalex-snapshot
Computability on random variables
inferredcites →https://doi.org/10.1017/s0022481200028073openalex-snapshot
Mechanical learners pay a price for Bayesianism
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1090/s0002-9939-1984-0749899-0openalex-snapshot
𝐿^{𝑝}-computability in recursive analysis
inferredcites →https://doi.org/10.1090/s0002-9947-1973-0322920-7openalex-snapshot
Probabilistic Recursive Functions
inferredcites →https://doi.org/10.1093/acprof:oso/9780199230761.001.0001openalex-snapshot
Computability and Randomness
inferredcites →https://doi.org/10.1109/jproc.1998.659497openalex-snapshot
Communication In The Presence Of Noise
inferredcites →https://doi.org/10.1109/lics.1996.561450openalex-snapshot
The Scott topology induces the weak topology
inferredcites →https://doi.org/10.1109/lics.2011.49openalex-snapshot
Noncomputable Conditional Distributions
inferredcites →https://doi.org/10.1109/sfcs.2005.58openalex-snapshot
On the Complexity of Real Functions
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1112/s0024610700008681openalex-snapshot
An Extension Result for Continuous Valuations
inferredcites →https://doi.org/10.1134/s0081543811060058openalex-snapshot
Algorithmic tests and randomness with respect to a class of measures
inferredcites →https://doi.org/10.1145/1250790.1250893openalex-snapshot
Constructing non-computable Julia sets
inferredcites →https://doi.org/10.1145/1452044.1452048openalex-snapshot
A probabilistic language based on sampling functions
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.1145/3321699openalex-snapshot
On the Computability of Conditional Probability
inferredcites →https://doi.org/10.1214/aop/1176994897openalex-snapshot
Conditional Distributions as Derivatives
inferredcites →https://doi.org/10.1307/mmj/1029000631openalex-snapshot
A recursive function, defined on a compact interval and having a continuous derivative that is not recursive.
inferredcites →https://doi.org/10.2307/2270581openalex-snapshot
Trial and error predicates and the solution to a problem of Mostowski
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2345230openalex-snapshot
Conditional Probability Distributions.
inferredcites →https://doi.org/10.2307/2533033openalex-snapshot
Conditional Measures and Applications.
inferredcites →https://doi.org/10.3217/jucs-014-06-0956openalex-snapshot
Notions of Probabilistic Computability on Represented Spaces
inferredcites →https://doi.org/10.3233/com-13015openalex-snapshot
L 1 -Computability, Layerwise Computability and Solovay Reducibility
inferredcites →https://doi.org/10.4064/fm-44-1-61-71openalex-snapshot
On the definitions of computable real continuous functions
inferredcites →https://doi.org/10.48550/arxiv.1112.2838openalex-snapshot
Computability of the Radon-Nikodym derivative
inferredcites →https://doi.org/10.48550/arxiv.1206.3255openalex-snapshot
Church: a language for generative models
inferredcites →https://doi.org/10.48550/arxiv.cs/0509042openalex-snapshot
Computing over the Reals: Foundations for Scientific Computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00153-021-00769-4openalex-snapshot
Pointwise complexity of the derivative of a computable function
inferred← citeshttps://doi.org/10.1007/s11098-025-02296-xopenalex-snapshot
Off-switching not guaranteed
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107239openalex-snapshot
A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.07.016openalex-snapshot
Adaptive learning-enforced broadcast policy for solar energy harvesting wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.compositesb.2025.113311openalex-snapshot
Numerical analysis of uncertainty propagation in short fiber-reinforced composites: From injection molding to material testing
inferred← citeshttps://doi.org/10.1016/j.jmp.2019.102308openalex-snapshot
Calibrating generative models: The probabilistic Chomsky–Schützenberger hierarchy
inferred← citeshttps://doi.org/10.1017/s0960129516000098openalex-snapshot
On computability and disintegration
inferred← citeshttps://doi.org/10.1109/lics.2011.49openalex-snapshot
Noncomputable Conditional Distributions
inferred← citeshttps://doi.org/10.1145/3649844openalex-snapshot
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
inferred← citeshttps://doi.org/10.1145/3691620.3695487openalex-snapshot
Parf: Adaptive Parameter Refining for Abstract Interpretation
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6577openalex-snapshot
Probabilistic Reasoning Across the Causal Hierarchy
inferred← citeshttps://doi.org/10.17760/d20618640openalex-snapshot
Towards compositional probabilistic programming
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:7)2014openalex-snapshot
Representations of measurable sets in computable measure theory
inferred← citeshttps://doi.org/10.22146/ijccs.90030openalex-snapshot
Modeling OTP Delivery Notification Status through a Causality Bayesian Network
inferred← citeshttps://doi.org/10.31489/2023no2/79-86openalex-snapshot
INFORMATION-ENTROPY METHOD FOR DETECTING GRAVITATIONAL WAVE SIGNALS
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4914openalex-snapshot
Building fast Bayesian computing machines out of intentionally stochastic, digital parts
inferred← citeshttps://doi.org/10.48550/arxiv.1606.00068openalex-snapshot
Quantifying the probable approximation error of probabilistic inference programs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.04240openalex-snapshot
Conditional probabilities and van Lambalgen theorem revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1701.06342openalex-snapshot
Bayesian definition of random sequences with respect to conditional probabilities
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07224openalex-snapshot
AIDE: An algorithm for measuring the accuracy of probabilistic inference algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2001.02889openalex-snapshot
Probabilistic Reasoning across the Causal Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.2104.06016openalex-snapshot
Extensional Denotational Semantics of Higher-Order Probabilistic Programs, Beyond the Discrete Case
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08558openalex-snapshot
A Topological Perspective on Causal Inference
showing the first 27 of 28 · page through all 28
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.