New Computational Paradigms(新计算范例/会议录)
|
读过这本书吗？
最近在读
读过
想读
还不熟悉
|
图书城书列：
加入到博客或社交网站：
|
|
我来评论这本书：
内容提要：
This book constitutes the refereed proceedings of the first International Conference on Computability in Europe, CiE 2005, held in Amsterdam, The Netherlands in June 2005.
The 68 revised full papers presented were carefully reviewed and selected from 144 submissions. Among them are papers corresponding to two tutorials, six plenary talks and papers of six special sessions involving mathematical logic and computer science at the same time as offering the methodological foundations for models of computation. The papers address many aspects of computability in Europe with a special focus on new computational paradigms. These include first of all connections between computation and physical systems (e.g., quantum and analog computation, neural nets, molecular computation), but also cover new perspectives on models of computation arising from basic research in mathematical logic and theoretical computer science. 目录：
If CiE Did Not Exist, It Would Be Necessary to Invent It
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees The Fan Theorem and Uniform Continuity Continuous Semantics for Strong Normalization A Thread Algebra with Multi-level Strategic Interleaving Membrane Computing Current Results and Future Problems How to Compare the Power of Computational Models Recombinant DNA, Gene Splicing as Generative Devices of Formal Languages Quantum Computing Symbol Grounding in Connectionist and Adaptive Agent Models The Complexity of Inductive Definability A Logical Approach to Abstract Algebra Schnorr Dimension Abstract Geometrical Computation: Turing-Computing Ability and Undecidability Computability in Computational Geometry SHRAD: A Language for Sequential Real Number Computation Borel Ranks and Wadge Degrees of Context Free w-Languages Fewer Epistemological Challenges for Connectionism An Algebraic View on Exact Learning from Queries The Church-Turing Thesis: Breaking the Myth Robust Simulations of Turing Machines with Analytic Maps and Flows Infinitary Computability with Infinite Time Turing Machines Combinatorial Models of Gene Assembly Symmetric Enumeration Reducibility Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory Finite Trees as Ordinals On the Problems of Definability in the Enumeration Degrees Computing a Model of Set Theory …… Author Index |