Cameron E. Freer

From MaRDI portal
Person:764272

Available identifiers

zbMath Open freer.cameron-eMaRDI QIDQ764272

List of research outcomes





PublicationDate of PublicationType
Algorithmic barriers to representing conditional independence2024-12-19Paper
Computable PAC learning of continuous features2024-12-06Paper
On computable aspects of algebraic and definable closure2022-02-08Paper
On computable learning of continuous features2021-11-23Paper
https://portal.mardi4nfdi.de/entity/Q50028292021-07-28Paper
Computability of algebraic and definable closure2020-05-06Paper
An introduction to feedback Turing computability2020-04-29Paper
The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions2020-03-08Paper
On the Computability of Conditional Probability2020-02-11Paper
Optimal Approximate Sampling from Discrete Probability Distributions2020-01-13Paper
https://portal.mardi4nfdi.de/entity/Q53766582019-05-17Paper
The entropy function of an invariant measure2018-09-06Paper
Feedback Turing Computability, and Turing Computability as Feedback2018-04-23Paper
On the computability of graphons2018-01-31Paper
Stable regularity for relational structures2017-12-26Paper
Graph Turing machines2017-12-20Paper
On computability and disintegration2017-11-22Paper
Properly ergodic structures2017-10-25Paper
Countable infinitary theories admitting an invariant measure2017-10-17Paper
Feedback computability on Cantor space2017-08-03Paper
On the computability of graph Turing machines2017-03-28Paper
Priors on exchangeable directed graphs2017-01-11Paper
A classification of orbits admitting a unique invariant measure2016-10-26Paper
INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES2016-07-06Paper
Invariant measures via inverse limits of finite structures2015-12-11Paper
Algorithmic Aspects of Lipschitz Functions2014-06-19Paper
Randomness extraction and asymptotic Hamming distance2013-09-26Paper
A Notion of a Computational Step for Partial Combinatory Algebras2013-05-28Paper
Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence2012-12-19Paper
Invariant measures concentrated on countable structures2012-06-18Paper
Computable de Finetti measures2012-03-13Paper
Computable Exchangeable Sequences Have Computable de Finetti Measures2010-07-28Paper
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal setsN/APaper

Research outcomes over time

This page was built for person: Cameron E. Freer