FOM: Re: recursion/computability/complexity theory

Harvey Friedman friedman at
Thu Sep 3 06:49:13 EDT 1998

>There are lots of other very interesting results in
>complexity that are either direct analogues to statements in recursion
>theory or are proved using its techniques (e.g., priority arguments).

I'm sure the FOM would like to hear about your favorite examples of the use
of priority arguments in complexity theory.

More information about the FOM mailing list