Title
Schnorr Layerwise Computability
Type
Talk at “Workshop on Proof Theory and Computability Theory 2012” on 20-23 Feb 2012.
Workshop website
Abstract
In order to formalize the notion of randomness mathematically,
the theory of algorithmic randomness uses computability theory.
Recent researches show that some notions in algorithmic randomness conversely
are useful to study computable analysis.
One example is layerwise computability defined by Hoyrup and Rojas 2009.
In this talk I introduce Schnorr layerwise computability,
which is a Schnorr-randomness version,
and explain why this is a more natural notion.
Download
slides