RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY.
The article discusses randomness via infinite computation and effective descriptive set theory. It discusses a study on randomness beyond Π11-randomness and its Martin-Löf type variant. It focuses on a class strictly between Π1 1 and Σ1 2 that is given by the infinite time Turing machines (ITTMs). R...
| Publicado en: | Journal of Symbolic Logic Vol. 83; no. 2; pp. 766 - 790 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jun2018
|
| 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=131027270&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 131027270 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224812 3TY jtl: Journal of Symbolic Logic issn: 00224812 maglogo: N pubinfo: dt: Jun2018 vid: 83 iid: 2 pid: 15979 pub: Cambridge University Press artinfo: ui: 131027270 10.1017/jsl.2018.3 ppf: 766 ppct: 24 formats: tig: atl: RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY. aug: au: CARL, MERLIN SCHLICHT, PHILIPP affil: FACHBEREICH MATHEMATIK UND STATISTIK UNIVERSITÄT KONSTANZ 78457 KONSTANZ, GERMANY MATHEMATISCHES INSTITUT, UNIVERSITÄT BONN ENDENICHER ALLEE 60 53115 BONN, GERMANY su: Computational statistics Set theory Random numbers Turing machines Martingales (Mathematics) Mathematics theorems sug: subj: Computational statistics Set theory Random numbers Turing machines Martingales (Mathematics) Mathematics theorems keyword: 03D32 03D60 03E15 algorithmic randomness effective descriptive set theory infinite time Turing machines ab: The article discusses randomness via infinite computation and effective descriptive set theory. It discusses a study on randomness beyond Π11-randomness and its Martin-Löf type variant. It focuses on a class strictly between Π1 1 and Σ1 2 that is given by the infinite time Turing machines (ITTMs). Results include mutual randoms not sharing information and that a version of van Lambalgen's theorem holds, and an analogue to a theorem of Sacks. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2018 holdings: @attributes: islocal: N |
|---|