找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: The Foundations of Computability Theory; Borut Robi? Textbook 20151st edition Springer-Verlag Berlin Heidelberg 2015 Algorithms.Computabil

[復制鏈接]
查看: 35460|回復: 35
樓主
發(fā)表于 2025-3-21 18:35:02 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱The Foundations of Computability Theory
編輯Borut Robi?
視頻videohttp://file.papertrans.cn/910/909908/909908.mp4
概述Original, informative view of the development of the fundamental concepts of computability theory.Avoids excessive formalism, offering instead intuitive understanding.Characterized by appreciation of
圖書封面Titlebook: The Foundations of Computability Theory;  Borut Robi? Textbook 20151st edition Springer-Verlag Berlin Heidelberg 2015 Algorithms.Computabil
描述.This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy...This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and t
出版日期Textbook 20151st edition
關鍵詞Algorithms; Computability theory; Models of computation; Oracles; Relative computability; Turing machine
版次1
doihttps://doi.org/10.1007/978-3-662-44808-3
isbn_softcover978-3-662-51601-0
isbn_ebook978-3-662-44808-3
copyrightSpringer-Verlag Berlin Heidelberg 2015
The information of publication is updating

書目名稱The Foundations of Computability Theory影響因子(影響力)




書目名稱The Foundations of Computability Theory影響因子(影響力)學科排名




書目名稱The Foundations of Computability Theory網(wǎng)絡公開度




書目名稱The Foundations of Computability Theory網(wǎng)絡公開度學科排名




書目名稱The Foundations of Computability Theory被引頻次




書目名稱The Foundations of Computability Theory被引頻次學科排名




書目名稱The Foundations of Computability Theory年度引用




書目名稱The Foundations of Computability Theory年度引用學科排名




書目名稱The Foundations of Computability Theory讀者反饋




書目名稱The Foundations of Computability Theory讀者反饋學科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 20:35:04 | 只看該作者
第109908主題貼--第2樓 (沙發(fā))
板凳
發(fā)表于 2025-3-22 01:08:36 | 只看該作者
板凳
地板
發(fā)表于 2025-3-22 05:47:25 | 只看該作者
第4樓
5#
發(fā)表于 2025-3-22 11:18:23 | 只看該作者
5樓
6#
發(fā)表于 2025-3-22 13:49:32 | 只看該作者
6樓
7#
發(fā)表于 2025-3-22 20:28:26 | 只看該作者
7樓
8#
發(fā)表于 2025-3-22 22:34:20 | 只看該作者
8樓
9#
發(fā)表于 2025-3-23 01:27:19 | 只看該作者
9樓
10#
發(fā)表于 2025-3-23 06:46:53 | 只看該作者
10樓
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 05:16
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
西华县| 青冈县| 古蔺县| 安福县| 抚远县| 平乡县| 奎屯市| 饶平县| 永宁县| 卓资县| 武穴市| 彭州市| 九寨沟县| 赞皇县| 阳原县| 北票市| 瑞丽市| 油尖旺区| 谢通门县| 册亨县| 团风县| 简阳市| 阳江市| 郴州市| 凤阳县| 泰州市| 双城市| 岳普湖县| 庄浪县| 安溪县| 绥芬河市| 冷水江市| 新巴尔虎右旗| 曲靖市| 泸溪县| 邛崃市| 聂拉木县| 清涧县| 怀仁县| 威海市| 文昌市|