rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: New Computational Paradigms
    sub title: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings
  name:
    name part: Cooper, S. Barry.
    role:
      role term: editor.
  name:
    name part: Löwe, Benedikt.
    role:
      role term: editor.
  name:
    name part: Torenvliet, Leen.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2005
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 578 p. online resource.
  table of contents: 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 Fra…
  note: edited by S. Barry Cooper, Benedikt Löwe, Leen Torenvliet.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Bioinformatics
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Computing Methodologies
  subject:
    topic: Bioinformatics
  subject:
    topic: Algorithms
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3526
  identifier: 9783540322665
  identifier: http://dx.doi.org/10.1007/b136981
  record info:
    record creation date: 110118
    record change date: 20151204185913.0
    record identifier: 978-3-540-32266-5