@article{miller_poonen_schoutens_shlapentokh_2018,
title={A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS},
volume={83},
DOI={10.1017/jsl.2017.50},
abstractNote={AbstractFried and Kollár constructed a fully faithful functor from the category of graphs to the category of fields. We give a new construction of such a functor and use it to resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure ${\cal S}$, there exists a countable field ${\cal F}$ of arbitrary characteristic with the same essential computable-model-theoretic properties as ${\cal S}$. Along the way, we develop a new "computable category theory", and prove that our functor and its partially defined inverse (restricted to the categories of countable graphs and countable fields) are computable functors.},
number={01},
publisher={Cambridge University Press (CUP)},
author={MILLER and POONEN and SCHOUTENS and SHLAPENTOKH},
year={2018}
}