Computability versus exact computability of martingales

  • Authors:
  • Jack H. Lutz

  • Affiliations:
  • Department of Computer Science, Iowa State University, Ames, IA 50011, USA

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

Abstract

This note gives a simple example of a polynomial-time computable martingale that has rational values but is not exactly computable.