top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Programs, Proofs, Processes [[electronic resource] ] : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings / / edited by Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes
Programs, Proofs, Processes [[electronic resource] ] : 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings / / edited by Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XIV, 450 p. 37 illus.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Compilers (Computer programs)
Computer science
Algorithms
Artificial intelligence
Programming Techniques
Compilers and Interpreters
Theory of Computation
Artificial Intelligence
ISBN 1-280-38752-1
9786613565440
3-642-13962-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNISA-996465576603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Programs, proofs, processes : 6th conference on computability in Europe, CIE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings / / Fernando Ferreira ... [et al.] (Eds.)
Programs, proofs, processes : 6th conference on computability in Europe, CIE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings / / Fernando Ferreira ... [et al.] (Eds.)
Edizione [1st ed.]
Pubbl/distr/stampa Berlin, : Springer, 2010
Descrizione fisica 1 online resource (XIV, 450 p. 37 illus.)
Disciplina 004.0151
Altri autori (Persone) FerreiraFernando
Collana LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science
Soggetto topico Computable functions
ISBN 1-280-38752-1
9786613565440
3-642-13962-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 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.
Record Nr. UNINA-9910484639703321
Berlin, : Springer, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
zSeries Application Assist Processor (zAAP) implementation [[electronic resource] /] / [Paul Rogers, Luiz Fadel, Fernando Ferreira]
zSeries Application Assist Processor (zAAP) implementation [[electronic resource] /] / [Paul Rogers, Luiz Fadel, Fernando Ferreira]
Autore Rogers Paul
Edizione [1st ed.]
Pubbl/distr/stampa Poughkeepsie, NY, : IBM, International Technical Support Organization, 2004
Descrizione fisica 1 online resource (70 p.)
Disciplina 004.2/2
Altri autori (Persone) FadelLuiz
FerreiraFernando
Collana IBM redbooks
Soggetto topico Computer architecture
Application software - Development
IBM computers
Soggetto genere / forma Electronic books.
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910449856803321
Rogers Paul  
Poughkeepsie, NY, : IBM, International Technical Support Organization, 2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
zSeries Application Assist Processor (zAAP) implementation [[electronic resource] /] / [Paul Rogers, Luiz Fadel, Fernando Ferreira]
zSeries Application Assist Processor (zAAP) implementation [[electronic resource] /] / [Paul Rogers, Luiz Fadel, Fernando Ferreira]
Autore Rogers Paul
Edizione [1st ed.]
Pubbl/distr/stampa Poughkeepsie, NY, : IBM, International Technical Support Organization, 2004
Descrizione fisica 1 online resource (70 p.)
Disciplina 004.2/2
Altri autori (Persone) FadelLuiz
FerreiraFernando
Collana IBM redbooks
Soggetto topico Computer architecture
Application software - Development
IBM computers
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910783416203321
Rogers Paul  
Poughkeepsie, NY, : IBM, International Technical Support Organization, 2004
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui