Computability and Complexity

Computability and Complexity pdf epub mobi txt 电子书 下载 2025

出版者:The MIT Press
作者:Neil D. Jones
出品人:
页数:484
译者:
出版时间:1997-01-15
价格:USD 75.00
装帧:Hardcover
isbn号码:9780262100649
丛书系列:Foundations of Computing
图书标签:
  • 计算理论
  • 计算机科学
  • Programming
  • CS-theroy
  • Complexity
  • CS
  • 编程
  • 复杂性
  • 计算理论
  • 可计算性
  • 复杂性理论
  • 图灵机
  • 形式语言
  • 算法
  • NP完全
  • P问题
  • 递归论
  • 计算模型
想要找书就要到 小美书屋
立刻按 ctrl+D收藏本页
你会得到大惊喜!!

具体描述

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Gödel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.<br /> <br /> According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models.<br /> <br /> New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs.<br /> <br /> Foundations of Computing series

作者简介

Neil Deaton Jones is a retired Professor of Computer Science at the University of Copenhagen.

目录信息

Introduction
3

The WHILE Language
27

Programs as Data Objects
47

Universal Programs for WHILE and I
69

Metaprogramming Selfapplication and Compiler Generation
89

Other Sequential Models of Computation
111

Robustness of Computability
127

Some Natural Unsolvable Problems
151

Overview of Complexity Theory
239

Time Usage of Treemanipulating Programs
261

Linear and Other Time Hierarchies for WHILE Programs
285

Spacebounded Computations
315

Nondeterministic Computations
331

Characterizations of LOGSPACE and PTIME by GOTO Programs
349

Completeness and Reduction of One Problem to Another
365

Complete Problems for PTIME
383

Hilberts Tenth Problem by M H Serensen
167

Inference Systems and Godels Incompleteness Theorem
187

Computability Theory Based on Numbers
205

More Abstract Approaches to Computability
215

Complete Problems for NPTIME
397

Appendix
412

Bibliography
447
· · · · · · (收起)

读后感

评分

评分

评分

评分

评分

用户评价

评分

一本很理论论的关于计算理论的书,因为参加相关讨论而读的。由于讨论只涉及到可计算性,后面半本没有读,整本书结构主线突出,讲的东西也不算太难,就是因为好久没有像在学校那样正式推导公式了,所以符号不太好记。里面提到的while语言也就是作为介绍理论用的,实用性不强。如果只是想了解起计算理论的话,可以不用读这本书。

评分

很棒的书!在网上随便搜到了这本书,作为第一本入门书来读了。 这本书的特色是使用编程语言(和递归数据结构)去讲述在可计算性和复杂度理论,比起数理逻辑传统递归论的数论方法显得极为平易近人。书的内容基本是经典的,虽然是第一本读的 TCS 书不过一些结论已经耳濡目染了解到了。更有趣的是书里还涉及到了丢番图方程和希尔伯特第十问题~ 要说有什么缺陷的话,就是内容太多,给的问题例子不够多,所有问题几乎都服务于定理证明了。 书的结构也非常好,每一章不长不短,证明一个定理和多个引理,读起来比较顺畅。习题没怎么做,基本是一些证明过程提出来,所以就不评论了。

评分

很棒的书!在网上随便搜到了这本书,作为第一本入门书来读了。 这本书的特色是使用编程语言(和递归数据结构)去讲述在可计算性和复杂度理论,比起数理逻辑传统递归论的数论方法显得极为平易近人。书的内容基本是经典的,虽然是第一本读的 TCS 书不过一些结论已经耳濡目染了解到了。更有趣的是书里还涉及到了丢番图方程和希尔伯特第十问题~ 要说有什么缺陷的话,就是内容太多,给的问题例子不够多,所有问题几乎都服务于定理证明了。 书的结构也非常好,每一章不长不短,证明一个定理和多个引理,读起来比较顺畅。习题没怎么做,基本是一些证明过程提出来,所以就不评论了。

评分

很棒的书!在网上随便搜到了这本书,作为第一本入门书来读了。 这本书的特色是使用编程语言(和递归数据结构)去讲述在可计算性和复杂度理论,比起数理逻辑传统递归论的数论方法显得极为平易近人。书的内容基本是经典的,虽然是第一本读的 TCS 书不过一些结论已经耳濡目染了解到了。更有趣的是书里还涉及到了丢番图方程和希尔伯特第十问题~ 要说有什么缺陷的话,就是内容太多,给的问题例子不够多,所有问题几乎都服务于定理证明了。 书的结构也非常好,每一章不长不短,证明一个定理和多个引理,读起来比较顺畅。习题没怎么做,基本是一些证明过程提出来,所以就不评论了。

评分

一本很理论论的关于计算理论的书,因为参加相关讨论而读的。由于讨论只涉及到可计算性,后面半本没有读,整本书结构主线突出,讲的东西也不算太难,就是因为好久没有像在学校那样正式推导公式了,所以符号不太好记。里面提到的while语言也就是作为介绍理论用的,实用性不强。如果只是想了解起计算理论的话,可以不用读这本书。

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有