Commands to typeset recursion theory papers
This package is designed to help mathematicians publishing papers in the area of recursion theory (aka Computability Theory) easily use standard notation. This includes easy commands to denote Turing reductions, Turing functionals, c.e. sets, stagewise computations, forcing and syntactic classes.
You can contact the maintainers of this package via email at
texlive dash maintainers at fedoraproject dot org.