计算屏障的逻辑方法： CiE 2006/会议录 Logical approaches to
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Arnold Beckmann 著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 608印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540354666包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, in June/July 2006.
The 31 revised full papers presented together with 30 invited papers were carefully reviewed and selected from about 80 submissions. Among them are papers corresponding to 8 plenary talks and papers of 6 special sessions entitled proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and Gödel centenary: Gödel's legacy for computability.
目录
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
From Constructibility and Absoluteness to Computability and Domain Independence
Datatype-Generic Reasoning
The Logical Strength of the Uniform Continuity Theorem
Elementary Algebraic Specifications of the Rational Function Field
Random Closed Sets
Deep Inference and Its Normal Form of Derivations
Logspace Complexity of Functions and Structures
Prefix-Like Complexities and Computability in the Limit
Partial Continuous Functions and Admissible Domain Representations
An Invariant Cost Model for the Lambda Calculus
On the Complexity of the Sperner Lemma
The Church-Turing Thesis: Consensus and Opposition
GSdel and the Origins of Computer Science
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
Turing Universality in Dynamical Systems
Every Sequence Is Decompressible from a Random One
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
Lambda-Terms
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? (Abstract)
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
Enumeration Reducibility with Polynomial Time Bounds
Coinductive Proofs for Basic Real Computation
A Measure of Space for Computing over the Reals
On Graph Isomorphism for Restricted Graph Classes
Infinite Time Register Machines
……
Author Index
