New Computational Paradigms: Changing Conceptions of What is Computable
暫譯: 新計算範式:改變可計算性的概念

***

  • 出版商: Springer
  • 出版日期: 2007-12-12
  • 售價: $6,780
  • 貴賓價: 9.5$6,441
  • 語言: 英文
  • 頁數: 560
  • 裝訂: Hardcover
  • ISBN: 0471026220
  • ISBN-13: 9780387360331
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

Description

In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological computing, and physical models) has brought focus to new paradigms of computation that are based on biological and physical models. These models address questions of efficiency in a radically new way and even threaten to move the so-called Turing barrier, i.e. the line between the decidable and the un-decidable.

This book examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. The book opens with an introduction by Alan Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms. The remaining material covers traditional topics in computability theory such as relative computability, theory of numberings, and domain theory, in addition to topics on the relationships between proof theory, computability, and complexity theory. New paradigms of computation arising from biology and quantum physics are also discussed, as well as the computability of the real numbers and its related issues.

This book is suitable for researchers and graduate students in mathematics, philosophy, and computer science with a special interest in logic and foundational issues. Most useful to graduate students are the survey papers on computable analysis and biological computing. Logicians and theoretical physicists will also benefit from this book.

商品描述(中文翻譯)

**描述**

近年來,經典可計算性已超越其原始範疇,開始探討與代數、分析及物理學相關的可計算性與複雜性問題。「計算」與「證明」之間的深刻相互關聯,促成了過去70年來在建構數學和數理邏輯領域中最重要的工作。此外,面對現實世界中日益迫切的可計算性需求(例如在連續數據、生物計算和物理模型上的計算),使得基於生物和物理模型的新計算範式受到關注。這些模型以全新的方式解決效率問題,甚至威脅到所謂的圖靈障礙,即可決定性與不可決定性之間的界線。

本書從數學的角度探討計算理論和實踐中的新發展,涵蓋的主題包括經典可計算性、複雜性、生物計算和量子計算。書中開篇由圖靈傳記作者艾倫·霍奇斯(Alan Hodges)撰寫的介紹,分析了預示計算新範式的開創性工作。其餘內容則涵蓋可計算性理論中的傳統主題,如相對可計算性、編號理論和範疇理論,以及證明理論、可計算性和複雜性理論之間的關係。書中還討論了來自生物學和量子物理的新計算範式,以及實數的可計算性及其相關問題。

本書適合對邏輯和基礎問題特別感興趣的數學、哲學和計算機科學的研究人員和研究生。對研究生最有幫助的是有關可計算分析和生物計算的調查論文。邏輯學家和理論物理學家也將從本書中受益。