default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathanael L. Ackerman
2020 – today
- 2024
[j16]Nathanael L. Ackerman
, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang:
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. Proc. ACM Program. Lang. 8(POPL): 1819-1849 (2024)- 2023
- [i10]Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang:
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets. CoRR abs/2312.17127 (2023) - 2022
- [j15]Nathanael L. Ackerman, Mary Leah Karker:
A Maximality Theorem for Continuous First Order Theories. Reports Math. Log. 57: 61-93 (2022) - [c9]Nathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan:
Computable PAC Learning of Continuous Features. LICS 2022: 7:1-7:12 - 2021
- [j14]Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
On computable aspects of algebraic and definable closure. J. Log. Comput. 31(1): 2-19 (2021) - [i9]Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
On computable aspects of algebraic and definable closure. CoRR abs/2101.11849 (2021) - [i8]Nathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan:
On computable learning of continuous features. CoRR abs/2111.14630 (2021) - 2020
- [j13]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
An introduction to feedback Turing computability. J. Log. Comput. 30(1): 27-60 (2020) - [j12]Nathanael Leedom Ackerman:
Encoding Complete Metric Structures by Classical Structures. Logica Universalis 14(4): 421-459 (2020) - [c8]Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
Computability of Algebraic and Definable Closure. LFCS 2020: 1-11
2010 – 2019
- 2019
- [j11]Nathanael L. Ackerman, Will Boney, Sebastien Vasey:
Categoricity in multiuniversal classes. Ann. Pure Appl. Log. 170(11) (2019) - [j10]Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
On the Computability of Conditional Probability. J. ACM 66(3): 23:1-23:40 (2019) - [j9]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback computability on Cantor space. Log. Methods Comput. Sci. 15(2) (2019) - [j8]Nathanael L. Ackerman, Will Brian:
Indivisible sets and well-founded orientations of the Rado graph. Math. Log. Q. 65(1): 46-56 (2019) - [c7]Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka:
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. AISTATS 2019: 1640-1649 - [c6]Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute:
Algorithmic barriers to representing conditional independence. LICS 2019: 1-13 - [i7]Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka:
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. CoRR abs/1902.10142 (2019) - 2018
- [c5]Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
The Beta-Bernoulli process and algebraic effects. ICALP 2018: 141:1-141:15 - [i6]Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute:
On the computability of graphons. CoRR abs/1801.10387 (2018) - [i5]Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
The Beta-Bernoulli process and algebraic effects. CoRR abs/1802.09598 (2018) - 2017
- [j7]Nathanael L. Ackerman, Cameron E. Freer, Aleksandra Kwiatkowska, Rehana Patel:
A classification of orbits admitting a unique invariant measure. Ann. Pure Appl. Log. 168(1): 19-36 (2017) - [j6]Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
On computability and disintegration. Math. Struct. Comput. Sci. 27(8): 1287-1314 (2017) - [c4]Nathanael L. Ackerman, Cameron E. Freer:
Graph Turing Machines. WoLLIC 2017: 1-13 - [i4]Nathanael L. Ackerman, Cameron E. Freer:
On the computability of graph Turing machines. CoRR abs/1703.09406 (2017) - [i3]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback computability on Cantor space. CoRR abs/1708.01139 (2017) - 2016
- [j5]Nathanael L. Ackerman, Cameron E. Freer, Jaroslav Nesetril, Rehana Patel:
Invariant measures via inverse limits of finite structures. Eur. J. Comb. 52: 248-289 (2016) - 2015
- [j4]Nathanael Leedom Ackerman:
Vaught's Conjecture Without Equality. Notre Dame J. Formal Log. 56(4): 573-582 (2015) - [c3]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback Turing Computability, and Turing Computability as Feedback. LICS 2015: 523-534 - [i2]Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
On computability and disintegration. CoRR abs/1509.02992 (2015) - 2014
- [j3]Nathanael Leedom Ackerman:
Sheaf Recursion and a Separation Theorem. J. Symb. Log. 79(3): 882-907 (2014) - [j2]Nathanael Leedom Ackerman:
On Transferring Model Theoretic Theorems of \({\mathcal{L}_{{\infty}, \omega}}\) in the Category of Sets to a Fixed Grothendieck Topos. Logica Universalis 8(3-4): 345-391 (2014) - 2013
- [c2]Nathanael L. Ackerman, Cameron E. Freer:
A Notion of a Computational Step for Partial Combinatory Algebras. TAMC 2013: 133-143 - 2011
- [c1]Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
Noncomputable Conditional Distributions. LICS 2011: 107-116 - 2010
- [j1]Nathanael Leedom Ackerman:
Relativized Grothendieck topoi. Ann. Pure Appl. Log. 161(10): 1299-1312 (2010) - [i1]Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
On the computability of conditional probability. CoRR abs/1005.3014 (2010)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
