找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Constructivity and Computability in Historical and Philosophical Perspective; Jacques Dubucs,Michel Bourdeau Book 2014 Springer Science+Bu

[復(fù)制鏈接]
查看: 45514|回復(fù): 40
樓主
發(fā)表于 2025-3-21 20:07:42 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Constructivity and Computability in Historical and Philosophical Perspective
編輯Jacques Dubucs,Michel Bourdeau
視頻videohttp://file.papertrans.cn/237/236142/236142.mp4
概述Offers an in depth look at the relationship between computability and constructivity.Follows the developments from Turing‘s ground-breaking linkage between computation and the machine and the final re
叢書名稱Logic, Epistemology, and the Unity of Science
圖書封面Titlebook: Constructivity and Computability in Historical and Philosophical Perspective;  Jacques Dubucs,Michel Bourdeau Book 2014 Springer Science+Bu
描述.Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day..Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics..This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s
出版日期Book 2014
關(guān)鍵詞BHK interpretation; Canonical Proof; Classification theory; Computing machines; Contructive mathematics;
版次1
doihttps://doi.org/10.1007/978-94-017-9217-2
isbn_softcover978-94-024-0707-5
isbn_ebook978-94-017-9217-2Series ISSN 2214-9775 Series E-ISSN 2214-9783
issn_series 2214-9775
copyrightSpringer Science+Business Media Dordrecht 2014
The information of publication is updating

書目名稱Constructivity and Computability in Historical and Philosophical Perspective影響因子(影響力)




書目名稱Constructivity and Computability in Historical and Philosophical Perspective影響因子(影響力)學(xué)科排名




書目名稱Constructivity and Computability in Historical and Philosophical Perspective網(wǎng)絡(luò)公開(kāi)度




書目名稱Constructivity and Computability in Historical and Philosophical Perspective網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Constructivity and Computability in Historical and Philosophical Perspective被引頻次




書目名稱Constructivity and Computability in Historical and Philosophical Perspective被引頻次學(xué)科排名




書目名稱Constructivity and Computability in Historical and Philosophical Perspective年度引用




書目名稱Constructivity and Computability in Historical and Philosophical Perspective年度引用學(xué)科排名




書目名稱Constructivity and Computability in Historical and Philosophical Perspective讀者反饋




書目名稱Constructivity and Computability in Historical and Philosophical Perspective讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:19:06 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:20:13 | 只看該作者
https://doi.org/10.1007/978-3-642-56569-4lability was developed more and more as a theory of computation by an idealized machine, or in the form of a general theory of algorithms. I will only deal here with the former aspect, a development that stems from the concepts introduced in 1936 by Turing. I will try to show how Turing’s ideas were
地板
發(fā)表于 2025-3-22 05:49:35 | 只看該作者
5#
發(fā)表于 2025-3-22 08:45:29 | 只看該作者
https://doi.org/10.1007/978-3-642-56569-4omplexity are presented: randomness and classification. The survey is divided in two parts in the same volume..Part II is dedicated to the relation between logic and information system, within the scope of Kolmogorov algorithmic information theory. We present a recent application of Kolmogorov compl
6#
發(fā)表于 2025-3-22 16:33:54 | 只看該作者
https://doi.org/10.1007/978-3-642-56569-4sts on a realist conception of the realm of mathematical objects. It must be recalled that the latter is not completely immune to such a reproach inasmuch as some vestige of realism is still present in its foundations (1). This realism takes the form of two different idealisations of human abilities
7#
發(fā)表于 2025-3-22 18:04:59 | 只看該作者
8#
發(fā)表于 2025-3-22 22:30:12 | 只看該作者
9#
發(fā)表于 2025-3-23 03:46:49 | 只看該作者
https://doi.org/10.1007/978-94-017-9217-2BHK interpretation; Canonical Proof; Classification theory; Computing machines; Contructive mathematics;
10#
發(fā)表于 2025-3-23 07:38:45 | 只看該作者
978-94-024-0707-5Springer Science+Business Media Dordrecht 2014
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(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ī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 21:29
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
石阡县| 开化县| 渭南市| 沙坪坝区| 高州市| 江西省| 平度市| 乌鲁木齐县| 桐乡市| 定兴县| 礼泉县| 周宁县| 县级市| 调兵山市| 江门市| 高安市| 丹阳市| 平乡县| 赫章县| 岱山县| 石泉县| 阿图什市| 广灵县| 前郭尔| 万盛区| 灯塔市| 印江| 闽侯县| 塘沽区| 昭通市| 寻乌县| 南投市| 利津县| 普定县| 兰溪市| 寻乌县| 枣阳市| 永寿县| 扶风县| 南雄市| 荣昌县|