Skip to content

Kenshi Miyabe

宮部賢志（ミヤベケンシ）

  • Contact
  • CV
  • Publications
  • Talks
  • Language: English
    • English English
    • 日本語 日本語
Posted on January 10, 2012February 8, 2012 by miyabe

An introduction to algorithmic randomness

Title
An introduction to algorithmic randomness

Type
Talk at GCOE tea time on 10 Jan 2012.

Download
slides

CategoriesTalks

Post navigation

Previous PostPrevious Characterization of Kurtz randomness by a differentiation theorem
Next PostNext An integral test for Schnorr randomness and its application

ここは研究者としての宮部賢志のウェブサイトです．教育に関する情報は宮部研究室ウェブサイトを御覧ください．

The website of Miyabe Lab contains information about teaching in Japanese.

Language:

  • English
  • 日本語

Contents

  • Contact
  • CV
  • Research Interest
  • Publications
  • Talks
  • Picture&Video
  • Links

Categories

  • Diary (10)
  • Publication (40)
  • Talks (126)

Recent Posts

  • General Learning Theory
  • Algorithmic randomness theory and learnability
  • Solovay reducibility via Lipschitz functions and signed-digit representation
  • Strong Solovay reducibility
  • Strong Solovay reducibility

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org

Monthly Archives

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
Proudly powered by WordPress