//]]>

Programs, Proofs, Processes (Record no. 13026)

000 -LEADER
fixed length control field 05112nam a22005415i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144050.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100627s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642139628
978-3-642-13962-8
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Ferreira, Fernando.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Programs, Proofs, Processes
Medium [electronic resource] :
Remainder of title 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 – July 4, 2010. Proceedings /
Statement of responsibility, etc edited by Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 450p. 37 illus.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 6158
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Avoiding Simplicity Is Complex -- Higher-Order Containers -- On the Completeness of Quantum Computation Models -- The Ordinal of Skolem + Tetration Is ? 0 -- Proofs, Programs, Processes -- Ergodic-Type Characterizations of Algorithmic Randomness -- How Powerful Are Integer-Valued Martingales? -- A Faster Algorithm for Finding Minimum Tucker Submatrices -- Processes in Space -- Computability of Countable Subshifts -- The Limits of Tractability in Resolution-Based Propositional Proof Systems -- Haskell before Haskell: Curry’s Contribution to Programming (1946–1950) -- A Miniaturisation of Ramsey’s Theorem -- Graph Structures and Algorithms for Query-Log Analysis -- On the Complexity of Local Search for Weighted Standard Set Problems -- Computational Interpretations of Analysis via Products of Selection Functions -- The Peirce Translation and the Double Negation Shift -- Counting the Changes of Random Sets -- Boole: From Calculating Numbers to Calculating Thoughts -- Approximability and Hardness in Multi-objective Optimization -- Is Not a Heyting Algebra -- Lower Bounds for Reducibility to the Kolmogorov Random Strings -- Spatial Models for Virtual Networks -- DNA Rearrangements through Spatial Graphs -- On Index Sets of Some Properties of Computable Algebras -- The Strength of the Besicovitch-Davies Theorem -- Circuit Complexity and Multiplicative Complexity of Boolean Functions -- Definability in the Subword Order -- Undecidability in Weihrauch Degrees -- Degrees with Almost Universal Cupping Property -- Incomputability in Physics -- Approximate Self-assembly of the Sierpinski Triangle -- Hairpin Lengthening -- Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program -- Computational Complexity Aspects in Membrane Computing -- Computable Ordered Abelian Groups and Fields -- Focusing in Asynchronous Games -- A Note on the Least Informative Model of a Theory -- Three Roots for Leibniz’s Contribution to the Computational Conception of Reason -- Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo -- The Complexity of Explicit Constructions -- Kolmogorov Complexity Cores -- Every -Set Is Natural, Up to Turing Equivalence -- Computable Fields and Weak Truth-Table Reducibility -- What Is the Problem with Proof Nets for Classical Logic? -- Quasi-linear Dialectica Extraction -- Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole -- Inference Concerning Physical Systems.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 6th Conference on Computability in Europe, CiE 2010, held in Ponta Delgada, Azores, Portugal, in June/July 2010. The 28 revised papers presented together with 20 invited lectures were carefully reviewed and selected from 90 submissions. The papers address not only the more established lines of research of computational complexity and the interplay between proofs and computation, but also novel views that rely on physical and biological processes and models to find new ways of tackling computations and improving their efficiency.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Artificial intelligence.
Topical term or geographic name as entry element Computer simulation.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Computation by Abstract Devices.
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Mathematical Logic and Formal Languages.
Topical term or geographic name as entry element Simulation and Modeling.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Löwe, Benedikt.
Relator term editor.
Personal name Mayordomo, Elvira.
Relator term editor.
Personal name Mendes Gomes, Luís.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642139611
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-13962-8
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-03-27AUM Main Library2014-03-27 2014-03-27 E-Book   AUM Main Library005.1