000			04970nam a22006135i 4500
001			978-3-642-13962-8
003			DE-He213
005			20240423125745.0
007			cr nn 008mamaa
008			100627s2010 gw | s |||| 0|eng d
020			_a9783642139628 _9978-3-642-13962-8
024	7		_a10.1007/978-3-642-13962-8 _2doi
050		4	_aQA76.6-76.66
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
072		7	_aUM _2thema
082	0	4	_a005.11 _223
245	1	0	_aPrograms, Proofs, Processes _h[electronic resource] : _b6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings / _cedited by Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes.
250			_a1st ed. 2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010.
300			_aXIV, 450 p. 37 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6158
505	0		_aAvoiding 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 AbelianGroups 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.
650		0	_aComputer programming.
650		0	_aCompilers (Computer programs).
650		0	_aComputer science.
650		0	_aAlgorithms.
650		0	_aArtificial intelligence.
650	1	4	_aProgramming Techniques.
650	2	4	_aCompilers and Interpreters.
650	2	4	_aTheory of Computation.
650	2	4	_aAlgorithms.
650	2	4	_aArtificial Intelligence.
700	1		_aFerreira, Fernando. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aLöwe, Benedikt. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aMayordomo, Elvira. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aGomes, Luís Mendes. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642139611
776	0	8	_iPrinted edition: _z9783642139635
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6158
856	4	0	_uhttps://doi.org/10.1007/978-3-642-13962-8
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c181377 _d181377