点击选择搜索分类
首页 - 中国文学- 正文
☆☆☆☆☆
||
Robert,I.Soare 著
出版社: 科学出版社 ISBN:9787030182951 版次:1 商品编码:11918288 包装:精装 丛书名: 国外数学名著系列(影印版) 外文名称:Recursively Enumerable Sets and Degrees:A Study of Computable Functions and Computably Generated Sets##
Part A. The Fundamental Concepts of Recursion Theory
Chapter Ⅰ. Recursive Functions
1. An Informal Description
2. Formal Definitions of Computable Functions
2.1. Primitive Recursive Functions
2.2. Diagonalization and Partial Recursive Functions
2.3. Turing Computable Functions
3. The Basic Results
4. Recursively Enumerable Sets and Unsolvable Problems
5. Recursive Permutations and Myhill's Isomorphism Theorem
Chapter Ⅱ. Fundamentals of Recursively Enumerable Sets and the Recursion Theorem
1. Equivalent Definitions of Recursively Enumerable Sets andTheir Basic Properties
2. Uniformity and Indices for Recursive and Finite Sets
3. The Recursion Theorem
4. Complete Sets, Productive Sets, and Creative Sets
Chapter Ⅲ. Turing Reducibility and the Jump Operator
1. Definitions of Relative Computability
2. Turing Degrees and the Jump Operator
3. The Modulus Lemma and Limit Lemma
Chapter Ⅳ. The Arithmetical Hierarchy
1. Computing Levels in the Arithmetical Hierarchy
2. Post's Theorem and the Hierarchy Theorem
3. En-Complete Sets
4. The Relativized Arithmetical Hierarchy and High and Low Degrees
Part B. Post's Problem, Oracle Constructions and the Finite Injury Priority Method
Chapter Ⅴ. Simple Sets and Post's Problem
1. Immune Sets, Simple Sets and Post's Construction
2. Hypersimple Sets and Majorizing Functions
3. The Permitting Method
4. Effectively Simple Sets Are Complete
5. A Completeness Criterion for R.E. Sets
Chapter Ⅵ. Oracle Constructions of Non-R.E. Degrees
1. A Pair of Incomparable Degrees Below 0'
2. Avoiding Cones of Degrees
3. Inverting the Jump
4. Upper and Lower Bounds for Degrees
5.* Minimal Degrees
Chapter Ⅶ. The Finite Injury Priority Method
1. Low Simple Sets
2. The Original Friedberg-Muchnik Theorem
3. SplittingTheorems
Part C. Infinitary Methods for Constructing R.E. Sets and Degrees
Chapter Ⅷ.The Infinite Injury Priority Method
1. The Obstacles in Infinite Injury and the Thickness Lemma
2. The Injury and Window Lemmas and the Strong Thickness Lemma
3. TheJump Theorem
4. The Density Theorem and the Sacks Coding Strategy
5.*The Pinball Machine Model for Infinite Injury
Chapter Ⅸ. The Minimal Pair Method and Embedding Lattices into the R.E. Degrees
1. Minimal Pairs and Embedding the Diamond Lattice
2.* Embedding DistributiveLattices
3. The Non-Diamond Theorem
4.* Nonbranching Degrees
5.*Noncappable Degrees
Chapter Ⅹ. The Lattice of R.E. Sets Under Inclusion
……
Part D. Advanced Topics and Current Research Areas in the R.E.Degrees and the Lattice
References
Notation Index
Subject Index
国外数学名著系列(影印版)31:递归可枚举集和图灵度 可计算函数与可计算生成集研究 [Recursively Enumerable Sets and Degrees:A Study of Comput 电子书 下载 mobi epub pdf txt
国外数学名著系列(影印版)31:递归可枚举集和图灵度 可计算函数与可计算生成集研究 [Recursively Enumerable Sets and Degrees:A Study of Comput-so88
国外数学名著系列(影印版)31:递归可枚举集和图灵度 可计算函数与可计算生成集研究 [Recursively Enumerable Sets and Degrees:A Study of Comput pdf epub mobi txt 电子书 下载 2022
图书介绍
☆☆☆☆☆
||
Robert,I.Soare 著
出版社: 科学出版社 ISBN:9787030182951 版次:1 商品编码:11918288 包装:精装 丛书名: 国外数学名著系列(影印版) 外文名称:Recursively Enumerable Sets and Degrees:A Study of Computable Functions and Computably Generated Sets##
内容简介
《国外数学名著系列(影印版)31:递归可枚举集和图灵度 可计算函数与可计算生成集研究》主要内容包括:An Informal DescriptionFormal Definitions of Computable FunctionsPrimitive Recursive Functions.Diagonalization and Partial Recursive FunctionsTuring Computable FunctionsThe Basic ResultsRecursive Permutations and Myhill's Isomorphism TheoremFundamentals of Recursively Enumerable Sets and the Recursion Theorem。内页插图
目录
IntroductionPart A. The Fundamental Concepts of Recursion Theory
Chapter Ⅰ. Recursive Functions
1. An Informal Description
2. Formal Definitions of Computable Functions
2.1. Primitive Recursive Functions
2.2. Diagonalization and Partial Recursive Functions
2.3. Turing Computable Functions
3. The Basic Results
4. Recursively Enumerable Sets and Unsolvable Problems
5. Recursive Permutations and Myhill's Isomorphism Theorem
Chapter Ⅱ. Fundamentals of Recursively Enumerable Sets and the Recursion Theorem
1. Equivalent Definitions of Recursively Enumerable Sets andTheir Basic Properties
2. Uniformity and Indices for Recursive and Finite Sets
3. The Recursion Theorem
4. Complete Sets, Productive Sets, and Creative Sets
Chapter Ⅲ. Turing Reducibility and the Jump Operator
1. Definitions of Relative Computability
2. Turing Degrees and the Jump Operator
3. The Modulus Lemma and Limit Lemma
Chapter Ⅳ. The Arithmetical Hierarchy
1. Computing Levels in the Arithmetical Hierarchy
2. Post's Theorem and the Hierarchy Theorem
3. En-Complete Sets
4. The Relativized Arithmetical Hierarchy and High and Low Degrees
Part B. Post's Problem, Oracle Constructions and the Finite Injury Priority Method
Chapter Ⅴ. Simple Sets and Post's Problem
1. Immune Sets, Simple Sets and Post's Construction
2. Hypersimple Sets and Majorizing Functions
3. The Permitting Method
4. Effectively Simple Sets Are Complete
5. A Completeness Criterion for R.E. Sets
Chapter Ⅵ. Oracle Constructions of Non-R.E. Degrees
1. A Pair of Incomparable Degrees Below 0'
2. Avoiding Cones of Degrees
3. Inverting the Jump
4. Upper and Lower Bounds for Degrees
5.* Minimal Degrees
Chapter Ⅶ. The Finite Injury Priority Method
1. Low Simple Sets
2. The Original Friedberg-Muchnik Theorem
3. SplittingTheorems
Part C. Infinitary Methods for Constructing R.E. Sets and Degrees
Chapter Ⅷ.The Infinite Injury Priority Method
1. The Obstacles in Infinite Injury and the Thickness Lemma
2. The Injury and Window Lemmas and the Strong Thickness Lemma
3. TheJump Theorem
4. The Density Theorem and the Sacks Coding Strategy
5.*The Pinball Machine Model for Infinite Injury
Chapter Ⅸ. The Minimal Pair Method and Embedding Lattices into the R.E. Degrees
1. Minimal Pairs and Embedding the Diamond Lattice
2.* Embedding DistributiveLattices
3. The Non-Diamond Theorem
4.* Nonbranching Degrees
5.*Noncappable Degrees
Chapter Ⅹ. The Lattice of R.E. Sets Under Inclusion
……
Part D. Advanced Topics and Current Research Areas in the R.E.Degrees and the Lattice
References
Notation Index
Subject Index
前言/序言
国外数学名著系列(影印版)31:递归可枚举集和图灵度 可计算函数与可计算生成集研究 [Recursively Enumerable Sets and Degrees:A Study of Comput 电子书 下载 mobi epub pdf txt
电子书下载地址:
相关电子书推荐:
- 文件名
- 灵光:改变科技进程的20大智慧瞬间
- 滇南本草(第二卷) 朱兆云,王京昆 云南科学技术出版社
- 常见传染病防治常识
- 中国古医籍整理丛书(本草29):艺林汇考饮食篇
- 芝麻大问号?-2-芝麻的科学书
- 消化内镜临床与实践
- 时间穿越指南:嘿,你制造了一个虫洞:the time traveler's guide t
- 套装6册有病早知道系列图解手诊+图解面诊+图解舌诊+救命之方等 药膳食谱食疗 中医基础理论书籍
- {RT}太阳系的奇迹-(英)考克斯,(英)科恩,齐锐,万昊宜 人民邮电出版社 978711
- 皮肤病安全用药手册
- 农博士答疑一万个为什么丛书:肉鸽养殖
- 遇见孩子,遇见更好的自己+给孩子一个好性格(套装共2册)
- 地球的历程 9787533176556
- 崔玉涛套装 看得见的发育+1-4岁宝贝健康从头到脚(套装共2册)
- {RT}生命:非同寻常的动物 匪夷所思的行为-[美] 玛莎·福尔摩斯,[美] 迈克尔·高顿