Person:456877: Difference between revisions

From MaRDI portal
Person:456877
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Nathanael Ackerman to Nathanael Ackerman: Duplicate
 
(No difference)

Latest revision as of 09:36, 11 December 2023

Available identifiers

zbMath Open ackerman.nathanael-leedomDBLP05/8630WikidataQ1966677 ScholiaQ1966677MaRDI QIDQ456877

List of research outcomes





PublicationDate of PublicationType
Algorithmic barriers to representing conditional independence2024-12-19Paper
Computable PAC learning of continuous features2024-12-06Paper
Computability of Countable Sunflowers2023-11-21Paper
Algebraic Sunflowers2023-10-24Paper
Cohen Generic Structures with Functions2023-10-17Paper
The Keisler order in continuous logic2023-02-01Paper
A Maximality Theorem for Continuous First Order Theories2022-12-15Paper
Potential isomorphisms of generalized approach spaces2022-04-12Paper
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
Encoding complete metric structures by classical structures2021-02-17Paper
Computability of algebraic and definable closure2020-05-06Paper
Indivisible sets and well‐founded orientations of the Rado graph2020-05-06Paper
An introduction to feedback Turing computability2020-04-29Paper
On the Computability of Conditional Probability2020-02-11Paper
Categoricity in multiuniversal classes2019-10-07Paper
https://portal.mardi4nfdi.de/entity/Q53766582019-05-17Paper
The entropy function of an invariant measure2018-09-06Paper
Categoricity in multiuniversal classes2018-04-24Paper
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
https://portal.mardi4nfdi.de/entity/Q34568482015-12-09Paper
Vaught's conjecture without equality2015-11-30Paper
Representations of Aut(M)-Invariant Measures2015-09-21Paper
Completeness in generalized ultrametric spaces2015-03-17Paper
On transferring model theoretic theorems of \(\mathcal L_{\infty,\omega}\) in the category of sets to a fixed Grothendieck topos2015-02-05Paper
SHEAF RECURSION AND A SEPARATION THEOREM2014-12-05Paper
A Notion of a Computational Step for Partial Combinatory Algebras2013-05-28Paper
The number of countable models in realizability toposes2012-10-16Paper
Invariant measures concentrated on countable structures2012-06-18Paper
https://portal.mardi4nfdi.de/entity/Q30938562011-10-19Paper
Relativized Grothendieck topoi2011-08-26Paper
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal setsN/APaper

Research outcomes over time

This page was built for person: Nathanael Ackerman