• 读书网|DuShu.com - 读书·学习·生活
  •  | 繁體版
  • 论坛
  • 畅销
  • 连载
  • 图书
  • 资讯
  • 首页
  • 国学/古籍 | 文学艺术 | 人文社科 | 经济管理 | 生活时尚 | 科学技术 | 教材教辅 | 少儿读物
  •    
  • 图书搜索:
  •  
     全部图书 可读图书 可购图书
     
  • 递归可枚举集和图灵度:可计算函数与(影印版) - 书籍详细信息
  • 查看同类图书:科学技术»自然科学»数学»递归可枚举集和图灵度:可计算函数与(影印版)
  • 递归可枚举集和图灵度:可计算函数与(影印版)

  • 【作 者】:(美)索尔
  • 【丛编项】:国外数学名著系列
  • 【装帧项】:精装 16 / 437
  • 【出版项】:科学出版社 / 2007-1
  • 【ISBN号】:9787030182951 / 7030182952
  • 【原书定价】:¥78.00 有3家书店打折销售 
  • 【主题词】:科学与自然-数学-数理逻辑、数学基础
  • 【图书简介】
      本书为英文影印版。-读书网|DuShu.com
  • 【本书目录】
    Introduction
    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
    SubjectIndex
  • 【购买本书】
  • 商城名称价格 配送信息优惠活动去看看购买

    卓越网
    ¥61.80
    送货上门:国内308个城市
    邮寄:全球
    特快专递:全球
    海外航空快递
    七周年店庆,全场免费配送 去看看 订购

    当当网
    ¥62.40 当天加急送:北京五环以内
    送货上门:国内178个城市
    邮寄:全球
    特快专递:全球
    特惠商品68折封顶 去看看 订购

    万卷百城
    ¥78.00
    去看看 订购

    中国图书馆网
    ¥0.4/页起
    邮寄、快递:全国
    特快专递EMS:全球
    提供稀缺绝版图书文献影印服务 去看看 预定
  • 说明:
  • 1、由于网上书店可能根据各种情况随时调整价格,我们的价格信息存在滞后性。以上价格仅作参考,具体以网上书店标示的价格为准。
    2、如价格折扣信息和原书定价存在较大误差,可能是该店售书为本书的不同版本或不同装祯形式,请读者自行鉴别。
    3、对如何网上购书存在疑问,请点击上面购书指南链接查询。
  • Copyright © 读书网 www.dushu.com 2006-2007, All Rights Reserved.
    鄂ICP备06000781号 公安备4201502577