发表于2024-11-07
Computability 2024 pdf epub mobi 电子书
上课地点:首都师范大学本部三教412室 是叶老师给逻辑学的研究生开的一门课,用一本经典的教材,好好读一本书。我们这学期的计划是完全读懂哥德尔不完备性定理,所以这本书读到第八章会读斯莫林斯基对不完备性的阐述,之后我们会在回来把余下的部分学完。 注:等这门课上完...
评分上课地点:首都师范大学本部三教412室 是叶老师给逻辑学的研究生开的一门课,用一本经典的教材,好好读一本书。我们这学期的计划是完全读懂哥德尔不完备性定理,所以这本书读到第八章会读斯莫林斯基对不完备性的阐述,之后我们会在回来把余下的部分学完。 注:等这门课上完...
评分上课地点:首都师范大学本部三教412室 是叶老师给逻辑学的研究生开的一门课,用一本经典的教材,好好读一本书。我们这学期的计划是完全读懂哥德尔不完备性定理,所以这本书读到第八章会读斯莫林斯基对不完备性的阐述,之后我们会在回来把余下的部分学完。 注:等这门课上完...
评分上课地点:首都师范大学本部三教412室 是叶老师给逻辑学的研究生开的一门课,用一本经典的教材,好好读一本书。我们这学期的计划是完全读懂哥德尔不完备性定理,所以这本书读到第八章会读斯莫林斯基对不完备性的阐述,之后我们会在回来把余下的部分学完。 注:等这门课上完...
评分上课地点:首都师范大学本部三教412室 是叶老师给逻辑学的研究生开的一门课,用一本经典的教材,好好读一本书。我们这学期的计划是完全读懂哥德尔不完备性定理,所以这本书读到第八章会读斯莫林斯基对不完备性的阐述,之后我们会在回来把余下的部分学完。 注:等这门课上完...
图书标签: 递归论 计算理论 计算机科学 数学 数理逻辑 可计算性 computability 计算机
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.
大学四年学得:编程编不成,汇编不会编,计组记不住,可计算不可计算。这本就是最后一句。
评分一本因为易读而显得杂乱的书
评分评论说...这是可计算性(递归论)最容易的一本入门书了...斯巴达了
评分轻松愉快
评分可以自学
Computability 2024 pdf epub mobi 电子书