|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-13962-8 |
| 003 |
DE-He213 |
| 005 |
20230221095419.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100627s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642139628
|9 978-3-642-13962-8
|
| 024 |
7 |
|
|a 10.1007/978-3-642-13962-8
|2 doi
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 thema
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Programs, Proofs, Processes
|h [electronic resource] :
|b 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings /
|c edited by Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a XIV, 450 p. 37 illus.
|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,
|x 2512-2029 ;
|v 6158
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 700 |
1 |
|
|a Ferreira, Fernando.
|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
|
| 700 |
1 |
|
|a Mayordomo, Elvira.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Gomes, Luís Mendes.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642139611
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642139635
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6158
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-13962-8
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
