#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2010

2018

- This year (7)
- Last 5 years (16)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nathanael Leedom Ackerman, Cameron E. Freer, Daniel M. Roy
- 2011 IEEE 26th Annual Symposium on Logic inâ€¦
- 2011

We study the computability of conditional probability, a fundamental notion in probability theory and Bayesian statistics. In the elementary discrete setting, a ratio of probabilities definesâ€¦ (More)

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe even more complex probabilistic models and inference algorithms. Whatâ€¦ (More)

- Nathanael Leedom Ackerman, Edward E Graves
- Physics in medicine and biology
- 2012

Targeted Î±-emitting drugs are promising for cancer therapy, but cannot be effectively imaged by conventional techniques. Cerenkov luminescence imaging (CLI) has previously been shown capable ofâ€¦ (More)

- Nathanael Leedom Ackerman, Cameron E. Freer, Daniel M. Roy
- Mathematical Structures in Computer Science
- 2017

We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is stronglyâ€¦ (More)

Î“-ultrametric spaces are spaces which satisfy all the axioms of an ultrametric space except that the distance function takes values in a complete lattice Î“ instead of Râ‰¥0. Î“-ultrametric spaces haveâ€¦ (More)

Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons. A natural estimation problem is how well we can recover a graphon given a single graph sampled from it.â€¦ (More)

- Nathanael Leedom Ackerman, Cameron E. Freer, Jaroslav Nesetril, Rehana Patel
- Eur. J. Comb.
- 2016

Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes ofâ€¦ (More)

- Nathanael Leedom Ackerman, Cameron E. Freer, Aleksandra Kwiatkowska, Rehana Patel
- Ann. Pure Appl. Logic
- 2017

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are Sâˆž-invariant andâ€¦ (More)

Working within the general formalism of a partial combinatory algebra (or PCA), we introduce and develop the notion of a step algebra, which enables us to work with individual computational steps,â€¦ (More)

- Nathanael Leedom Ackerman
- Ann. Pure Appl. Logic
- 2010

In this paper we define a notion of relativization for higher order logic. We then show that there is a higher order theory of Grothendieck topoi such that all Grothendieck topoi relativizes to allâ€¦ (More)