Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A stronger Kolmogorov zero-one law for resource-bounded measure

From MaRDI portal
Publication:1870565
Jump to:navigation, search

DOI10.1016/S0304-3975(02)00320-1zbMath1026.68070MaRDI QIDQ1870565

Jack Jie Dai

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

computational complexitymartingaleresource-bounded measureKolmogorov zero-one law


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)


Related Items (1)

An outer-measure approach for resource-bounded measure




Cites Work

  • Almost everywhere high nonuniform complexity
  • Process complexity and effective random tests
  • [https://portal.mardi4nfdi.de/wiki/Publication:5587565 Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung]
  • A unified approach to the definition of random sequences
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: A stronger Kolmogorov zero-one law for resource-bounded measure

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1870565&oldid=14261271"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki