32 citations · 80 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.LO2018★ 3 cited
On the close interaction between algorithmic randomness and constructive/computable measure theory
Jason Rute
This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measur…
math.LO2018★ 3 cited
On the computability of graphons
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer +2
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in e…