Version:
3.4
Copyright:
Peter M. Gerdes
License:
pd
Packaged on:
6/9/2020 8:11:17 PM
Number of files:
5
Size on disk:
197.6 kB

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.