The Problem: First Pass

Abstract
Intuitively, it seems that S 1 is “more random” or “less regular” than S 2. In other words, it seems more plausible (in some sense) that S 1 (as opposed to S 2) was generated by a random process ( e.g. , by tossing a fair coin eight times, and recording an H for a heads outcome and a T for a tails outcome). We will use the notation x σ 1 ą σ 2y to express the claim that xstring σ 1 is more random than string σ 2y. And, we take it to be intuitively clear that — on any plausible definition of such a relation — we should have S 1 ą S 2
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 12,101
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Daniel Osherson (2008). Recognizing Strong Random Reals. Review of Symbolic Logic 1 (1):56-63.
Analytics

Monthly downloads

Added to index

2011-10-08

Total downloads

13 ( #127,469 of 1,102,135 )

Recent downloads (6 months)

1 ( #306,622 of 1,102,135 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.