点击选择搜索分类
首页 - 音频图书- 正文
☆☆☆☆☆
||
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
电子书下载地址:
相关电子书推荐:
- 文件名
- 三只小猪-经典童话涂色游戏书
- Excel图表之道 如何制作专业有效的商务图表(典藏版)
- 昆虫记 9787511367501 亨利·法布尔;王光波-RT
- 数学之美(第二版)
- 三叶虫胖胖历险记 9787563545674
- 徐州省运会志
- 老师也偷偷看的科学书:改变世界的化学实验
- 一本书读懂众筹(全彩图解版)
- 推动丛书:物理系列(套装) 9787535795571
- React与Redux开发实例精解
- 神奇的太空 科普读物 书籍
- Java核心技术(卷2):高级特性(原书第9版) [Core Java, Volume II--Advanced Features]
- 宇宙的尺度:从无穷大到无穷小 9787559600257 (美) 大卫·布拉特纳,未读 出
- 炒股不求人—价量关系实战
- 一笔创意画-新编儿童学画-儿童智能绘画-少儿美术培训机构.配套课本1-7