找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Computability; A Mathematical Sketc Douglas S. Bridges Textbook 1994 Springer Science+Business Media New York 1994 complexity.computability

[復(fù)制鏈接]
查看: 43832|回復(fù): 43
樓主
發(fā)表于 2025-3-21 18:29:16 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Computability
副標(biāo)題A Mathematical Sketc
編輯Douglas S. Bridges
視頻videohttp://file.papertrans.cn/233/232023/232023.mp4
叢書名稱Graduate Texts in Mathematics
圖書封面Titlebook: Computability; A Mathematical Sketc Douglas S. Bridges Textbook 1994 Springer Science+Business Media New York 1994 complexity.computability
描述Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, .Computability: A. .Mathematical Sketchbook. provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice‘s theorem and the recursion theorem, and provides a systematic account of Blum‘s complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.
出版日期Textbook 1994
關(guān)鍵詞complexity; computability; function; recursion; theorem
版次1
doihttps://doi.org/10.1007/978-1-4612-0863-1
isbn_softcover978-1-4612-6925-0
isbn_ebook978-1-4612-0863-1Series ISSN 0072-5285 Series E-ISSN 2197-5612
issn_series 0072-5285
copyrightSpringer Science+Business Media New York 1994
The information of publication is updating

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




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




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




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




書目名稱Computability被引頻次




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




書目名稱Computability年度引用




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




書目名稱Computability讀者反饋




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




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:05:46 | 只看該作者
,Rice’s Theorem and the Recursion Theorem,eory. The first of these, Rice’s Theorem, characterises a large class of nonrecursive subsets of .; the second, the Recursion Theorem, has many applications, some of which appear at the end of this chapter, and some, in perhaps unexpected contexts, in later chapters.
板凳
發(fā)表于 2025-3-22 01:39:09 | 只看該作者
地板
發(fā)表于 2025-3-22 04:52:52 | 只看該作者
5#
發(fā)表于 2025-3-22 09:58:46 | 只看該作者
6#
發(fā)表于 2025-3-22 13:10:05 | 只看該作者
Abstract Complexity Theory,and brevity, they enable us to prove a remarkable range of theorems about complexity in the most general context. These theorems hold independently of their interpretation in any model of computation, such as the Turing machine model; our abstract theory of complexity is ..
7#
發(fā)表于 2025-3-22 18:51:27 | 只看該作者
8#
發(fā)表于 2025-3-22 21:22:44 | 只看該作者
9#
發(fā)表于 2025-3-23 03:49:19 | 只看該作者
https://doi.org/10.1007/978-3-031-06377-0and brevity, they enable us to prove a remarkable range of theorems about complexity in the most general context. These theorems hold independently of their interpretation in any model of computation, such as the Turing machine model; our abstract theory of complexity is ..
10#
發(fā)表于 2025-3-23 06:49:50 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-2-1 11:39
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
瓮安县| 大埔县| 两当县| 黄骅市| 丹凤县| 莆田市| 西贡区| 东乡县| 固镇县| 洛隆县| 朝阳市| 遵义县| 城口县| 梅州市| 探索| 隆德县| 许昌县| 临邑县| 雅江县| 罗城| 郸城县| 高邮市| 秦安县| 纳雍县| 隆昌县| 通许县| 公主岭市| 内丘县| 和静县| 宿州市| 太白县| 安丘市| 马关县| 屏南县| 积石山| 丰县| 西平县| 当雄县| 泰州市| 玉环县| 晋江市|