Computability and Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024

☆☆☆☆☆
簡體網頁||繁體網頁

Neil D. Jones 作者

The MIT Press

譯者

1997-01-15 出版日期

484 頁數

USD 75.00 價格

Hardcover

Foundations of Computing 叢書系列

9780262100649 圖書編碼

Computability and Complexity 在線電子書圖書標籤: 計算理論計算機科學 Programming CS-theroy Complexity CS 編程復雜性

喜歡 Computability and Complexity 在線電子書的讀者還喜歡

下載鏈接在頁面底部

點擊這裡下載

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

發表於2024-09-27

Computability and Complexity 在線電子書 epub 下載 mobi 下載 pdf 下載 txt 下載 2024

Computability and Complexity 在線電子書 epub 下載 pdf 下載 mobi 下載 txt 下載 2024

Computability and Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024

Computability and Complexity 在線電子書用戶評價

評分☆☆☆☆☆

很棒的書！在網上隨便搜到瞭這本書，作為第一本入門書來讀瞭。這本書的特色是使用編程語言（和遞歸數據結構）去講述在可計算性和復雜度理論，比起數理邏輯傳統遞歸論的數論方法顯得極為平易近人。書的內容基本是經典的，雖然是第一本讀的 TCS 書不過一些結論已經耳濡目染瞭解到瞭。更有趣的是書裏還涉及到瞭丟番圖方程和希爾伯特第十問題～要說有什麼缺陷的話，就是內容太多，給的問題例子不夠多，所有問題幾乎都服務於定理證明瞭。書的結構也非常好，每一章不長不短，證明一個定理和多個引理，讀起來比較順暢。習題沒怎麼做，基本是一些證明過程提齣來，所以就不評論瞭。

評分☆☆☆☆☆

Computability and Complexity 在線電子書著者簡介

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

Computability and Complexity 在線電子書著者簡介

Computability and Complexity 在線電子書 pdf 下載 txt下載 epub 下載 mobi 在線電子書下載

Computability and Complexity 在線電子書圖書描述

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. 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. 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. Foundations of Computing series

Computability and Complexity 在線電子書下載 mobi epub pdf txt 在線電子書下載

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!