ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS.
In this article, I consider the status of several statements analogous to the Church–Turing thesis that assert that some definition of algorithmic randomness captures the intuitive conception of randomness. I argue that we should not only reject the theses that have appeared in the algorithmic rando...
| Publicado en: | Review of Symbolic Logic Vol. 9; no. 3; pp. 456 - 480 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Sep2016
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=118003903&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 118003903 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 17550203 8OI1 jtl: Review of Symbolic Logic issn: 17550203 maglogo: N pubinfo: dt: Sep2016 vid: 9 iid: 3 pid: 15979 pub: Cambridge University Press artinfo: ui: 118003903 10.1017/S1755020316000113 ppf: 456 ppct: 24 formats: tig: atl: ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS. aug: au: PORTER, CHRISTOPHER P. su: Algorithmic randomness Mathematics Algorithms Mathematics theorems Mathematical functions sug: subj: Algorithmic randomness Mathematics Algorithms Mathematics theorems Mathematical functions ab: In this article, I consider the status of several statements analogous to the Church–Turing thesis that assert that some definition of algorithmic randomness captures the intuitive conception of randomness. I argue that we should not only reject the theses that have appeared in the algorithmic randomness literature, but more generally that we ought not evaluate the adequacy of a definition of randomness on the basis of whether it captures the so-called intuitive conception of randomness to begin with. Instead, I argue that a more promising alternative is to evaluate the adequacy of a definition of randomness on the basis of whether it captures what I refer to as a “notion of almost everywhere typicality.” In support of my main claims, I will appeal to recent work in showing the connection between of algorithmic randomness and certain “almost everywhere” theorems from classical mathematics. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2016 holdings: @attributes: islocal: N |
|---|