点击选择搜索分类
首页 - 项目管理- 正文
☆☆☆☆☆
||
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
电子书下载地址:
相关电子书推荐:
- 文件名
- BF-宇宙大爆炸之前 -宇宙的史前历史-[英]布莱恩·克莱格 海南出版社 97875443
- 宝宝发烧生病突发意外怎么办
- 回家 9787030449658 谢立军-RT
- 男孩版加女孩版2册】正版好妈妈不打不骂培养男孩300个细节+好妈妈不娇不惯培养女孩300个细节 家庭
- {RT}通用博物学图典:-【法】夏尔·亨利·德萨利纳·奥尔比尼(Ch 中国青年出版社 97
- 这样爱你刚刚好 小学 阶段 包邮 裸背装 我的五年级孩子
- 幻想的奇迹:技术发明99
- 美的教育简单(2014年中国好书)
- 献给空巢老人的安全宝典----大伟话安全 9787501456864 王大伟工作室-RT
- 教你如何读高中(修订版)一个中学校长的116次谈话
- 生命的守望 与生物及医学对话
- 走出丛林的管理心理学 徐联仓 9787303083763
- 芝麻大问号?-2-芝麻的科学书
- 【XH】 三四年级-名师教你做父母
- 分散性土研究 樊恒辉,孔令伟