Coverart for item
The Resource Programs, proofs, processes : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings, Fernando Ferreira [and others] (eds.)

Programs, proofs, processes : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings, Fernando Ferreira [and others] (eds.)

Label
Programs, proofs, processes : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings
Title
Programs, proofs, processes
Title remainder
6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings
Statement of responsibility
Fernando Ferreira [and others] (eds.)
Title variation
CiE 2010
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation
Member of
Cataloging source
GW5XE
Dewey number
511.3/52
Illustrations
illustrations
Index
index present
LC call number
QA9.59
LC item number
.C66 2010
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2010
http://bibfra.me/vocab/lite/meetingName
Conference on Computability in Europe
Nature of contents
  • dictionaries
  • bibliography
NLM call number
QA 9.59
http://library.link/vocab/relatedWorkOrContributorDate
1958-
http://library.link/vocab/relatedWorkOrContributorName
Ferreira, Fernando
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
6158
http://library.link/vocab/subjectName
  • Computable functions
  • Computing Methodologies
  • Computational intelligence
  • Logic, Symbolic and mathematical
  • Algorithms
  • Computable functions
  • Informatique
  • Computable functions
  • Theoretische Informatik
  • Berechenbarkeit
  • Berechnungskomplexität
  • Beweistheorie
  • Prozessalgebra
  • Mathematische Logik
Summary expansion
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
Label
Programs, proofs, processes : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings, Fernando Ferreira [and others] (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
654396640
Dimensions
unknown
Extent
1 online resource (xvi, 450 pages)
Form of item
online
Isbn
9783642139628
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-13962-8
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-13961-1
Specific material designation
remote
System control number
(OCoLC)654396640
Label
Programs, proofs, processes : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; proceedings, Fernando Ferreira [and others] (eds.)
Publication
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
654396640
Dimensions
unknown
Extent
1 online resource (xvi, 450 pages)
Form of item
online
Isbn
9783642139628
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-13962-8
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-13961-1
Specific material designation
remote
System control number
(OCoLC)654396640

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...