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.
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910779414203321 |
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910823942503321 |
|
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen
| Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (937 p.) |
| Disciplina |
510.92
B |
| Altri autori (Persone) |
CooperS. B (S. Barry)
LeeuwenJ. van (Jan) |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910452723403321 |
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910461306003321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context [[electronic resource] ] : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910789411903321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computability in context : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi
| Computability in context : computation and logic in the real world / / editors, S. Barry Cooper, Andrea Sorbi |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (419 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
SorbiAndrea <1956-> |
| Soggetto topico |
Computable functions
Computational intelligence Set theory Mathematics - Philosophy |
| ISBN |
1-283-14816-1
9786613148162 1-84816-277-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Computation, Information, and the Arrow of Time P. Adriaans & P. van Emde Boas; 2. The Isomorphism Conjecture for NP M. Agrawal; 3. The Ershov Hierarchy M. M. Arslanov; 4. Complexity and Approximation in Reoptimization G. Ausiello, V. Bonifaci, & B. Escoffer; 5. Definability in the Real Universe S. B. Cooper; 6. HF-Computability Y. L. Ershov, V. G. Puzarenko, & A. I. Stukachev; 7. The Mathematics of Computing between Logic and Physics G. Longo & T. Paul; 8. Liquid State Machines: Motivation, Theory, and Applications W. Maass
9. Experiments on an Internal Approach to Typed Algorithms in Analysis D. Normann10. Recursive Functions: An Archeological Look P. Odifreddi; 11. Reverse Mathematics and Well-ordering Principles M. Rathjen & A. Weiermann; 12. Discrete Transfinite Computation Models P. D. Welch |
| Record Nr. | UNINA-9910820400803321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi
| Computation and Logic in the Real World [[electronic resource] ] : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 826 p.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| ISBN | 3-540-73001-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shifting and Lifting of Cellular Automata -- Learning as Data Compression -- Reachability Problems: An Update -- RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice -- Producer/Consumer in Membrane Systems and Petri Nets -- A Minimal Pair in the Quotient Structure M/NCup -- Constructive Dimension and Weak Truth-Table Degrees -- A Classification of Viruses Through Recursion Theorems -- Borel Complexity of Topological Operations on Computable Metric Spaces -- Colocatedness and Lebesgue Integrability -- Computing with Genetic Gates -- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems -- Characterizing Programming Systems Allowing Program Self-reference -- K-Trivial Closed Sets and Continuous Functions -- Pseudojump Operators and Classes -- Sofic Trace Subshift of a Cellular Automaton -- Thin Maximal Antichains in the Turing Degrees -- Effective Computation for Nonlinear Systems -- On Rules and Parameter Free Systems in Bounded Arithmetic -- The New Promise of Analog Computation -- Comparing C.E. Sets Based on Their Settling Times -- Time-Complexity Semantics for Feasible Affine Recursions -- Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers -- Feasible Depth -- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model -- A Continuous Derivative for Real-Valued Functions -- Refocusing Generalised Normalisation -- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number -- Parameterized Complexity and Logic -- Index Sets of Computable Structures with Decidable Theories -- Minimal Representations for Majority Games -- Linear Transformations in Boolean Complexity Theory -- Exact Pair Theorem for the ?-Enumeration Degrees -- Operational Semantics for Positive Relevant Logics Without Distribution -- Multi-valued Logics, Effectiveness and Domains -- Internal Computability -- Post’s Problem for Ordinal Register Machines -- Unique Existence and Computability in Constructive Reverse Mathematics -- Input-Dependence in Function-Learning -- Some Notes on Degree Spectra of the Structures -- Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus -- The Polynomial and Linear Hierarchies in V0 -- The Uniformity Principle for ?-Definability with Applications to Computable Analysis -- Circuit Complexity of Regular Languages -- Definability in the Homomorphic Quasiorder of Finite Labeled Forests -- Physics and Computation: The Status of Landauer’s Principle -- Strict Self-assembly of Discrete Sierpinski Triangles -- Binary Trees and (Maximal) Order Types -- A Weakly 2-Random Set That Is Not Generalized Low -- Speed-Up Theorems in Type-2 Computation -- The Complexity of Quickly ORM-Decidable Sets -- On Accepting Networks of Splicing Processors of Size 3 -- Liquid Computing -- Quotients over Minimal Type Theory -- Hairpin Completion Versus Hairpin Reduction -- Hierarchies in Fragments of Monadic Strict NP -- Membrane Systems and Their Application to Systems Biology -- Some Aspects of a Complexity Theory for Continuous Time Systems -- Enumerations and Torsion Free Abelian Groups -- Locally Computable Structures -- Logic and Control -- Nash Stability in Additively Separable Hedonic Games Is NP-Hard -- Comparing Notions of Computational Entropy -- From Logic to Physics: How the Meaning of Computation Changed over Time -- Theories and Ordinals: Ordinal Analysis -- Computable Riemann Surfaces -- Rank Lower Bounds for the Sherali-Adams Operator -- Infinite Computations and a Hierarchy in ? 3 -- Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation -- Biochemical Reactions as Computations -- Doing Without Turing Machines: Constructivism and Formal Topology -- Problems as Solutions -- A Useful Undecidable Theory -- On the Computational Power of Flip-Flop Proteins on Membranes -- Computability and Incomputability -- A Jump Inversion Theorem for the Degree Spectra -- Cupping Enumeration Degrees to 0 e ? -- What Is the Lesson of Quantum Computing? -- Does the Cell Compute? -- Computational Complexity of Constraint Satisfaction -- Finding Most Likely Solutions -- Turing Unbound: Transfinite Computation -- Computability in Amorphous Structures -- The Complexity of Small Universal Turing Machines -- Approximating Generalized Multicut on Trees -- (Short) Survey of Real Hypercomputation -- Characterizing Programming Systems Allowing Program Self-reference. |
| Record Nr. | UNISA-996466108003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computation and Logic in the Real World : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi
| Computation and Logic in the Real World : Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe, Andrea Sorbi |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 826 p.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| ISBN | 3-540-73001-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Shifting and Lifting of Cellular Automata -- Learning as Data Compression -- Reachability Problems: An Update -- RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice -- Producer/Consumer in Membrane Systems and Petri Nets -- A Minimal Pair in the Quotient Structure M/NCup -- Constructive Dimension and Weak Truth-Table Degrees -- A Classification of Viruses Through Recursion Theorems -- Borel Complexity of Topological Operations on Computable Metric Spaces -- Colocatedness and Lebesgue Integrability -- Computing with Genetic Gates -- Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems -- Characterizing Programming Systems Allowing Program Self-reference -- K-Trivial Closed Sets and Continuous Functions -- Pseudojump Operators and Classes -- Sofic Trace Subshift of a Cellular Automaton -- Thin Maximal Antichains in the Turing Degrees -- Effective Computation for Nonlinear Systems -- On Rules and Parameter Free Systems in Bounded Arithmetic -- The New Promise of Analog Computation -- Comparing C.E. Sets Based on Their Settling Times -- Time-Complexity Semantics for Feasible Affine Recursions -- Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers -- Feasible Depth -- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model -- A Continuous Derivative for Real-Valued Functions -- Refocusing Generalised Normalisation -- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number -- Parameterized Complexity and Logic -- Index Sets of Computable Structures with Decidable Theories -- Minimal Representations for Majority Games -- Linear Transformations in Boolean Complexity Theory -- Exact Pair Theorem for the ?-Enumeration Degrees -- Operational Semantics for Positive Relevant Logics Without Distribution -- Multi-valued Logics, Effectiveness and Domains -- Internal Computability -- Post’s Problem for Ordinal Register Machines -- Unique Existence and Computability in Constructive Reverse Mathematics -- Input-Dependence in Function-Learning -- Some Notes on Degree Spectra of the Structures -- Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus -- The Polynomial and Linear Hierarchies in V0 -- The Uniformity Principle for ?-Definability with Applications to Computable Analysis -- Circuit Complexity of Regular Languages -- Definability in the Homomorphic Quasiorder of Finite Labeled Forests -- Physics and Computation: The Status of Landauer’s Principle -- Strict Self-assembly of Discrete Sierpinski Triangles -- Binary Trees and (Maximal) Order Types -- A Weakly 2-Random Set That Is Not Generalized Low -- Speed-Up Theorems in Type-2 Computation -- The Complexity of Quickly ORM-Decidable Sets -- On Accepting Networks of Splicing Processors of Size 3 -- Liquid Computing -- Quotients over Minimal Type Theory -- Hairpin Completion Versus Hairpin Reduction -- Hierarchies in Fragments of Monadic Strict NP -- Membrane Systems and Their Application to Systems Biology -- Some Aspects of a Complexity Theory for Continuous Time Systems -- Enumerations and Torsion Free Abelian Groups -- Locally Computable Structures -- Logic and Control -- Nash Stability in Additively Separable Hedonic Games Is NP-Hard -- Comparing Notions of Computational Entropy -- From Logic to Physics: How the Meaning of Computation Changed over Time -- Theories and Ordinals: Ordinal Analysis -- Computable Riemann Surfaces -- Rank Lower Bounds for the Sherali-Adams Operator -- Infinite Computations and a Hierarchy in ? 3 -- Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation -- Biochemical Reactions as Computations -- Doing Without Turing Machines: Constructivism and Formal Topology -- Problems as Solutions -- A Useful Undecidable Theory -- On the Computational Power of Flip-Flop Proteins on Membranes -- Computability and Incomputability -- A Jump Inversion Theorem for the Degree Spectra -- Cupping Enumeration Degrees to 0 e ? -- What Is the Lesson of Quantum Computing? -- Does the Cell Compute? -- Computational Complexity of Constraint Satisfaction -- Finding Most Likely Solutions -- Turing Unbound: Transfinite Computation -- Computability in Amorphous Structures -- The Complexity of Small Universal Turing Machines -- Approximating Generalized Multicut on Trees -- (Short) Survey of Real Hypercomputation -- Characterizing Programming Systems Allowing Program Self-reference. |
| Record Nr. | UNINA-9910483765103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
New computational paradigms : first conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005 : proceedings / / S. Barry Cooper, Benedikt Lowe, Leen Torenvliet (eds.)
| New computational paradigms : first conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005 : proceedings / / S. Barry Cooper, Benedikt Lowe, Leen Torenvliet (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XVIII, 578 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
LoweBenedikt TorenvlietLeen |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computable functions |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It -- Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees -- The Fan Theorem and Uniform Continuity -- Continuous Semantics for Strong Normalization -- A Thread Algebra with Multi-level Strategic Interleaving -- Membrane Computing — Current Results and Future Problems -- How to Compare the Power of Computational Models -- Recombinant DNA ,Gene Splicing as Generative Devices of Formal Languages -- Quantum Computing -- Symbol Grounding in Connectionist and Adaptive Agent Models -- The Complexity of Inductive Definability -- A Logical Approach to Abstract Algebra -- Schnorr Dimension -- Abstract Geometrical Computation: Turing-Computing Ability and Undecidability -- Computability in Computational Geometry -- Shrad: A Language for Sequential Real Number Computation -- Borel Ranks and Wadge Degrees of Context Free ?-Languages -- Fewer Epistemological Challenges for Connectionism -- An Algebraic View on Exact Learning from Queries -- The Church-Turing Thesis: Breaking the Myth -- Robust Simulations of Turing Machines with Analytic Maps and Flows -- Infinitary Computability with Infinite Time Turing Machines -- Combinatorial Models of Gene Assembly -- Symmetric Enumeration Reducibility -- Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory -- Finite Trees as Ordinals -- On the Problems of Definability in the Enumeration Degrees -- Computing a Model of Set Theory -- Proof Mining in Functional Analysis -- Towards Computability of Higher Type Continuous Data -- The Power of Mobility: Four Membranes Suffice -- The Small Grzegorczyk Classes and the Typed ?-Calculus -- The Flow of Data and the Complexity of Algorithms -- On a Question of Sacks — A Partial Solution on the Positive Side -- The Low Splitting Theorem in the Difference Hierarchy -- Geometric Software: Robustness Issues and Model of Computation -- The Dimension of a Point: Computability Meets Fractal Geometry -- Accepting Networks of Splicing Processors -- Hilbert’s Tenth Problem and Paradigms of Computation -- On Some Relations Between Approximation Problems and PCPs over the Real Numbers -- Correlation Dimension and the Quality of Forecasts Given by a Neural Network -- The Computational Complexity of One-Dimensional Sandpiles -- Categoricity in Restricted Classes -- Recursion and Complexity -- FM-Representability and Beyond -- Formalising Exact Arithmetic in Type Theory -- Complexity in Predicative Arithmetic -- Domain-Theoretic Formulation of Linear Boundary Value Problems -- Membrane Computing: Power, Efficiency, Applications -- The Analogue of Büchi’s Problem for Polynomials -- On the Turing Degrees of Divergence Bounded Computable Reals -- New Algorithmic Paradigms in Exponential Time Algorithms -- Some Reducibilities on Regular Sets -- Computability and Discrete Dynamical Systems -- Uniform Operators -- Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures -- Presentations of K-Trivial Reals and Kolmogorov Complexity -- Presentations of Structures in Admissible Sets -- An Environment Aware P-System Model of Quorum Sensing -- Kripke Models, Distributive Lattices, and Medvedev Degrees -- Arthur-Merlin Games and the Problem of Isomorphism Testing -- Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality -- A Network Model of Analogue Computation over Metric Algebras -- Computable Analysis -- The Transfinite Action of 1 Tape Turing Machines -- Complexity of Continuous Space Machine Operations -- Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation -- Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. |
| Altri titoli varianti | CiE 2005 |
| Record Nr. | UNINA-9910483180403321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsa, China, May 18-22, 2009 ; proceedings / / Jianer Chen, S. Barry Cooper (eds.)
| Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsa, China, May 18-22, 2009 ; proceedings / / Jianer Chen, S. Barry Cooper (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XIV, 482 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
ChenJianer
CooperS. B (S. Barry) |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computational complexity
Computable functions |
| ISBN | 3-642-02017-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Talks -- Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks -- Constraints, Graphs, Algebra, Logic, and Complexity -- Distributed Systems and Their Environments -- Invited Special Session: Models of Computation -- Co-evolution and Information Signals in Biological Sequences -- The Extended Turing Model as Contextual Tool -- Strong Positive Reducibilities -- Invited Special Session: Algorithms and Complexity -- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering -- On Spanners of Geometric Graphs -- Searching Trees: An Essay -- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems -- Contributed Papers -- A Quadratic Kernel for 3-Set Packing -- Quantitative Aspects of Speed-Up and Gap Phenomena -- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG -- On the Connection between Interval Size Functions and Path Counting -- On the Red/Blue Spanning Tree Problem -- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata -- A Computational Proof of Complexity of Some Restricted Counting Problems -- Block-Graph Width -- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs -- On Parameterized Exponential Time Complexity -- Best-Order Streaming Model -- Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces -- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data -- Improved Deterministic Algorithms for Weighted Matching and Packing Problems -- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover -- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability -- A Complete Characterisation of the Linear Clique-Width of Path Powers -- Preserving Privacy versus Data Retention -- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity -- An Almost Totally Universal Tile Set -- Linear Kernel for Planar Connected Dominating Set -- A Simple Greedy Algorithm for the k-Disjoint Flow Problem -- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions -- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code -- Terminal Coalgebras for Measure-Polynomial Functors -- High Minimal Pairs in the Enumeration Degrees -- Searching a Circular Corridor with Two Flashlights -- On the Complexity of the Multiple Stack TSP, kSTSP -- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments -- An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues -- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem -- On the Tractability of Maximal Strip Recovery -- Greedy Local Search and Vertex Cover in Sparse Random Graphs -- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms -- Feasibility of Motion Planning on Directed Graphs -- Polynomial-Time Algorithm for Sorting by Generalized Translocations -- The Two-Guard Polygon Walk Problem -- Approximation and Hardness Results for Label Cut and Related Problems -- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge. |
| Altri titoli varianti |
Models of computation
TAMC 2009 |
| Record Nr. | UNINA-9910483469203321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
