Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
33
click to vote
MST
2006
92
views
more
MST 2006
»
Some Results on Effective Randomness
13 years 10 months ago
Download
math.uni-heidelberg.de
We investigate the characterizations of effective randomness in terms of Martin-L
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Sla...
claim paper
Read More »
27
click to vote
CIE
2010
Springer
158
views
Applied Computing
»
more
CIE 2010
»
How Powerful Are Integer-Valued Martingales?
14 years 2 months ago
Download
people.cs.uchicago.edu
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
claim paper
Read More »