Skip to content

Kenshi Miyabe

宮部賢志(ミヤベケンシ)

  • Contact
  • CV
  • Publications
  • Talks
  • Language: English
    • English English
    • 日本語 日本語
Posted on September 16, 2010February 8, 2012 by miyabe

Algorithmic randomness over general spaces

Title
Algorithmic randomness over general spaces

Type
Talk

This talk is in “Formal Systems and Computability Theory” as a RIMS research project in Kyoto in Japan on Sep 16, 2010.
This talk is based on the paper Algorithmic randomness over general spaces.

Download
slide
Attached slides are in English.
Attached slides are in English.

CategoriesTalks

Post navigation

Previous PostPrevious Limit theorems on a computable topological space
Next PostNext How much better can we predict the future: predictability and the limit.

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

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 (38)
  • Talks (118)

Recent Posts

  • Subclasses of the weakly computable reals
  • Subclasses of weakly computable reals that form real closed
  • Rational sequences converging to left-c.e. reals of positive effective Hausdorff dimension
  • Subclasses of weakly computable reals
  • Generality of computable measures

Meta

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

Monthly Archives

Meta

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