中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
The typical Turing degree
Author: Barmpalias, George ; Day, Adam R. ; Lewis-Pye, Andy E. M.
Source: PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY
Issued Date: 2014
Volume: 109, Pages:1-39
Indexed Type: SCI
Department: [Barmpalias, George] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. [Day, Adam R.] Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA. [Lewis-Pye, Andy E. M.] Univ London London Sch Econ & Polit Sci, Dept Math, London WC2A 2AE, England.
Abstract: The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that, for any property which may or may not be satisfied by any given Turing degree, the satisfying class will either be of Lebesgue measure 0 or 1, so long as it is measurable. So either the typical degree satisfies the property, or else the typical degree satisfies its negation. Further, there is then some level of randomness sufficient to ensure typicality in this regard. We describe and prove a large number of results in a new programme of research which aims to establish the (order theoretically) definable properties of the typical Turing degree, and the level of randomness required in order to guarantee typicality. A similar analysis can be made in terms of Baire category, where a standard form of genericity now plays the role that randomness plays in the context of measure. This case has been fairly extensively examined in the previous literature. We analyse how our new results for the measure-theoretic case contrast with existing results for Baire category, and also provide some new results for the category-theoretic analysis.
English Abstract: The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that, for any property which may or may not be satisfied by any given Turing degree, the satisfying class will either be of Lebesgue measure 0 or 1, so long as it is measurable. So either the typical degree satisfies the property, or else the typical degree satisfies its negation. Further, there is then some level of randomness sufficient to ensure typicality in this regard. We describe and prove a large number of results in a new programme of research which aims to establish the (order theoretically) definable properties of the typical Turing degree, and the level of randomness required in order to guarantee typicality. A similar analysis can be made in terms of Baire category, where a standard form of genericity now plays the role that randomness plays in the context of measure. This case has been fairly extensively examined in the previous literature. We analyse how our new results for the measure-theoretic case contrast with existing results for Baire category, and also provide some new results for the category-theoretic analysis.
Language: 英语
WOS ID: WOS:000339951600001
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16848
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Barmpalias, George,Day, Adam R.,Lewis-Pye, Andy E. M.. The typical Turing degree[J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY,2014-01-01,109:1-39.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Barmpalias, George]'s Articles
[Day, Adam R.]'s Articles
[Lewis-Pye, Andy E. M.]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Barmpalias, George]‘s Articles
[Day, Adam R.]‘s Articles
[Lewis-Pye, Andy E. M.]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2022  中国科学院软件研究所 - Feedback
Powered by CSpace