by Leigh Humphries
Institution: The University of Melbourne ** Room 215
Date: Fri 15th August 2008
Time: 4:15 PM
Location: Room 215, Richard Berry Bldg, The University of Melbourne
Abstract: There is a recursively enumerable set with Turing degree strictly between 0 and 0'.
For More Information: Greg Hjorth email@example.com