[Alta-Logic] Peripatetic seminar jiggled!

[Robin Cockett]

Time:  Wed. 19th Jan. 2011  3:30-4:30pm

Place: ICT616

Speaker: Pavel Hrubes

Title: On twin non-computable functions

Abstract:
Assume that we have a set X and a total recursive function f such that 
for every n, X differs from the n-th r.e. set W_n in the point f(n). 
Then X is strong enough to compute the Halting problem 0'. A similar 
observation applies when we replace "n-th r.e. set" by "n-th 
arithmetical set" and 0' by 0^{\omega}. We investigate what happens, if 
instead of being given a single point where X and W_n differ, we are 
given a finite list of candidates to choose from.


==================================
 Still discussing time ...
 Still looking for volunteers ...
 See you there ...
         -robin