BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Schnorr triviality is equivalent to being a basis for tt-Schnorr r
 andomness - Miyabe\, K (Kyoto University)
DTSTART:20120702T140000Z
DTEND:20120702T143000Z
UID:TALK38799@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We present some new characterizations of Schnorr triviality. S
 chnorr\ntriviality is defined using complexity via a computable measure ma
 chine\,\nwith which Schnorr randomness has a characterization. Since we ha
 ve a\ncharacterization of Schnorr randomness via decidable prefix-free mac
 hine\,\nwe also have a characterization of Schnorr triviality using comple
 xity\nvia a decidable prefix-free machine. It should be noted that numerou
 s\ncharacterizations of Schnorr triviality have the following form: for an
 y\ncomputable object\, there exists another computable object such that th
 e\nreal is in some object. By defining a basis for Schnorr randomness in a
 \nsimilar manner\, we can show the equivalence to Schnorr triviality while
 \nFranklin and Stephan (2010) showed that there exists a Schnorr trivial\n
 set that is not truth-table reducible to any Schnorr random set.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR