What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.
發表於2024-11-07
Computability 2024 pdf epub mobi 電子書 下載
上課地點:首都師範大學本部三教412室 是葉老師給邏輯學的研究生開的一門課,用一本經典的教材,好好讀一本書。我們這學期的計劃是完全讀懂哥德爾不完備性定理,所以這本書讀到第八章會讀斯莫林斯基對不完備性的闡述,之後我們會在迴來把餘下的部分學完。 注:等這門課上完...
評分上課地點:首都師範大學本部三教412室 是葉老師給邏輯學的研究生開的一門課,用一本經典的教材,好好讀一本書。我們這學期的計劃是完全讀懂哥德爾不完備性定理,所以這本書讀到第八章會讀斯莫林斯基對不完備性的闡述,之後我們會在迴來把餘下的部分學完。 注:等這門課上完...
評分上課地點:首都師範大學本部三教412室 是葉老師給邏輯學的研究生開的一門課,用一本經典的教材,好好讀一本書。我們這學期的計劃是完全讀懂哥德爾不完備性定理,所以這本書讀到第八章會讀斯莫林斯基對不完備性的闡述,之後我們會在迴來把餘下的部分學完。 注:等這門課上完...
評分上課地點:首都師範大學本部三教412室 是葉老師給邏輯學的研究生開的一門課,用一本經典的教材,好好讀一本書。我們這學期的計劃是完全讀懂哥德爾不完備性定理,所以這本書讀到第八章會讀斯莫林斯基對不完備性的闡述,之後我們會在迴來把餘下的部分學完。 注:等這門課上完...
評分上課地點:首都師範大學本部三教412室 是葉老師給邏輯學的研究生開的一門課,用一本經典的教材,好好讀一本書。我們這學期的計劃是完全讀懂哥德爾不完備性定理,所以這本書讀到第八章會讀斯莫林斯基對不完備性的闡述,之後我們會在迴來把餘下的部分學完。 注:等這門課上完...
圖書標籤: 遞歸論 計算理論 計算機科學 數學 數理邏輯 可計算性 computability 計算機
輕鬆愉快
評分入門
評分一本非常友好的遞歸論入門教材,適閤零基礎讀者。
評分老師推薦,入門可計算性確實不錯。
評分比較容易理解,慢慢看起來比較流暢,並沒有讀完
Computability 2024 pdf epub mobi 電子書 下載