New Computational Paradigms First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings / edited by Barry S. Cooper, Benedikt Löwe.

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Cooper, Barry S. (Editor), Löwe, Benedikt (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edition:1st ed. 2005.
Series:Theoretical Computer Science and General Issues ; 3526
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3288958
003 MWH
005 20191025121434.0
007 cr nn 008mamaa
008 110118s2005 gw | s |||| 0|eng d
020 |a 9783540322665 
024 7 |a 10.1007/b136981  |2 doi 
035 |a (DE-He213)978-3-540-32266-5 
050 4 |a E-Book 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
245 1 0 |a New Computational Paradigms  |h [electronic resource] :  |b First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings /  |c edited by Barry S. Cooper, Benedikt Löwe. 
250 |a 1st ed. 2005. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2005. 
300 |a XVIII, 578 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 3526 
490 1 |a Springer eBook Collection 
505 0 |a Introduction: 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 ?-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 -- Proof Mining in Functional Analysis -- Towards Computability of Higher Type Continuous Data -- The Power of Mobility: Four Membranes Suffice -- The Small Grzegorczyk Classes and the Typed ?-Calculus -- The Flow of Data and the Complexity of Algorithms -- On a Question of Sacks — A Partial Solution on the Positive Side -- The Low Splitting Theorem in the Difference Hierarchy -- Geometric Software: Robustness Issues and Model of Computation -- The Dimension of a Point: Computability Meets Fractal Geometry -- Accepting Networks of Splicing Processors -- Hilbert’s Tenth Problem and Paradigms of Computation -- On Some Relations Between Approximation Problems and PCPs over the Real Numbers -- Correlation Dimension and the Quality of Forecasts Given by a Neural Network -- The Computational Complexity of One-Dimensional Sandpiles -- Categoricity in Restricted Classes -- Recursion and Complexity -- FM-Representability and Beyond -- Formalising Exact Arithmetic in Type Theory -- Complexity in Predicative Arithmetic -- Domain-Theoretic Formulation of Linear Boundary Value Problems -- Membrane Computing: Power, Efficiency, Applications -- The Analogue of Büchi’s Problem for Polynomials -- On the Turing Degrees of Divergence Bounded Computable Reals -- New Algorithmic Paradigms in Exponential Time Algorithms -- Some Reducibilities on Regular Sets -- Computability and Discrete Dynamical Systems -- Uniform Operators -- Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures -- Presentations of K-Trivial Reals and Kolmogorov Complexity -- Presentations of Structures in Admissible Sets -- An Environment Aware P-System Model of Quorum Sensing -- Kripke Models, Distributive Lattices, and Medvedev Degrees -- Arthur-Merlin Games and the Problem of Isomorphism Testing -- Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality -- A Network Model of Analogue Computation over Metric Algebras -- Computable Analysis -- The Transfinite Action of 1 Tape Turing Machines -- Complexity of Continuous Space Machine Operations -- Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation -- Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science—Mathematics. 
650 0 |a Artificial intelligence. 
650 0 |a Bioinformatics. 
690 |a Electronic resources (E-books) 
700 1 |a Cooper, Barry S.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Löwe, Benedikt.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Theoretical Computer Science and General Issues ;  |v 3526 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/b136981  |3 Click to view e-book  |t 0 
907 |a .b32889586  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i22021206  |z 02-26-20 
999 f f |i a8e21eb4-ebb7-5f00-a4ce-b070d90a6897  |s 21991800-c275-560a-b849-a263bf1a0c80  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File