找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Turing Computability; Theory and Applicati Robert I. Soare Textbook 2016 Springer-Verlag Berlin Heidelberg 2016 Alan Turing.Computability t

[復(fù)制鏈接]
查看: 27133|回復(fù): 35
樓主
發(fā)表于 2025-3-21 17:38:43 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Turing Computability
副標(biāo)題Theory and Applicati
編輯Robert I. Soare
視頻videohttp://file.papertrans.cn/932/931061/931061.mp4
概述Author is among the world‘s leading authorities on the topic of computability.Content has been thoroughly class-tested for many years by hundreds of lecturers and teachers in this field.Emphasizes the
叢書名稱Theory and Applications of Computability
圖書封面Titlebook: Turing Computability; Theory and Applicati Robert I. Soare Textbook 2016 Springer-Verlag Berlin Heidelberg 2016 Alan Turing.Computability t
描述.Turing‘s famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject.?.Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part IIincludes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use
出版日期Textbook 2016
關(guān)鍵詞Alan Turing; Computability theory; Computably enumerable (C; E; ) sets; Turing reducibility; Finite injury
版次1
doihttps://doi.org/10.1007/978-3-642-31933-4
isbn_softcover978-3-662-56858-3
isbn_ebook978-3-642-31933-4Series ISSN 2190-619X Series E-ISSN 2190-6203
issn_series 2190-619X
copyrightSpringer-Verlag Berlin Heidelberg 2016
The information of publication is updating

書目名稱Turing Computability影響因子(影響力)




書目名稱Turing Computability影響因子(影響力)學(xué)科排名




書目名稱Turing Computability網(wǎng)絡(luò)公開度




書目名稱Turing Computability網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Turing Computability被引頻次




書目名稱Turing Computability被引頻次學(xué)科排名




書目名稱Turing Computability年度引用




書目名稱Turing Computability年度引用學(xué)科排名




書目名稱Turing Computability讀者反饋




書目名稱Turing Computability讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:09:53 | 只看該作者
第131061主題貼--第2樓 (沙發(fā))
板凳
發(fā)表于 2025-3-22 03:02:46 | 只看該作者
板凳
地板
發(fā)表于 2025-3-22 06:33:04 | 只看該作者
第4樓
5#
發(fā)表于 2025-3-22 08:46:03 | 只看該作者
5樓
6#
發(fā)表于 2025-3-22 14:31:23 | 只看該作者
6樓
7#
發(fā)表于 2025-3-22 19:21:13 | 只看該作者
7樓
8#
發(fā)表于 2025-3-22 22:16:59 | 只看該作者
8樓
9#
發(fā)表于 2025-3-23 05:14:29 | 只看該作者
9樓
10#
發(fā)表于 2025-3-23 06:58:08 | 只看該作者
10樓
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 07:29
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
淮阳县| 鄂托克前旗| 绍兴市| 繁昌县| 建阳市| 界首市| 德化县| 家居| 城固县| 垫江县| 黄浦区| 阳春市| 沽源县| 鄂州市| 玉门市| 西城区| 通江县| 察隅县| 慈利县| 富源县| 大埔县| 舞阳县| 清水河县| 兴宁市| 台南市| 鄱阳县| 万源市| 黎城县| 屏山县| 双城市| 曲麻莱县| 融水| 岢岚县| 泰和县| 赤壁市| 寻甸| 河西区| 承德市| 综艺| 金川县| 进贤县|