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.
Computation, Physics and Beyond [[electronic resource] ] : International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers / / edited by Michael J. Dinneen, Bakhadyr Khoussainov, Prof. Andre Nies
| Computation, Physics and Beyond [[electronic resource] ] : International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers / / edited by Michael J. Dinneen, Bakhadyr Khoussainov, Prof. Andre Nies |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XIII, 427 p. 64 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Machine theory Computer science Computer science—Mathematics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Mathematics of Computing Lògica informàtica Sistemes adaptatius |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-642-27654-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Art of Reaching the Age of Sixty -- Calude as Father of One of the Computer Science Journals -- Random Semicomputable Reals Revisited -- Constructing the In mum of Two Projections -- Bounded Randomness -- A Note on Blum Static Complexity Measures -- A Program-Size Complexity Measure for Mathematical Problems and Conjectures -- On Degrees of Randomness and Genetic Randomness -- Hartmanis-Stearns Conjecture on Real Time and Transcendence -- Learning Families of Closed Sets in Matroids -- Invariance and Universality of Complexity -- Demuth's Path to Randomness (extended abstract) -- Correcting Codes -- Some Transfinite Generalisations of Gödel's Incompleteness Theorem -- Phase Transition between Unidirectionality and Bidirectionality -- Computer Runtimes and the Length of Proofs -- Symmetry of Information: A Closer Look -- How Much Information Can There Be in a Real Number? -- Mathematics, Metaphysics and the Multiverse -- Exponential Decay in Quantum Mechanics -- Randomness Increases Order in Biological Evolution -- Haunted Quantum Contextuality Versus Value Indefiniteness -- Outerplanar Graphs and Delaunay Triangulations -- Representing Reaction Systems by Trees -- Derivatives of Regular Expressions and An Application -- Triangular and Hexagonal Tile Self-Assembly Systems -- dP Automata versus Right-Linear Simple Matrix Grammars -- State Complexity of Kleene-Star Operations on Trees -- Composition Sequences and Synchronizing Automata -- On the Connected Partition Dimension of a Wheel Related Graph. |
| Record Nr. | UNISA-996465936303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in Language Theory [[electronic resource] ] : 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings / / edited by Cristian S. Calude, Elena Calude, Michael J. Dinneen
| Developments in Language Theory [[electronic resource] ] : 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings / / edited by Cristian S. Calude, Elena Calude, Michael J. Dinneen |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer logic Computers Computer science—Mathematics Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Computation by Abstract Devices Discrete Mathematics in Computer Science |
| ISBN | 3-540-30550-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey -- Some New Directions and Questions in Parameterized Complexity -- Basic Notions of Reaction Systems -- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms -- Algebraic and Topological Models for DNA Recombinant Processes -- Contributed Papers -- Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet -- On Competence in CD Grammar Systems -- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels -- Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages -- On the Maximum Coefficients of Rational Formal Series in Commuting Variables -- On Codes Defined by Bio-operations -- Avoidable Sets and Well Quasi-Orders -- A Ciliate Bio-operation and Language Families -- Semantic Shuffle on and Deletion Along Trajectories -- Sturmian Graphs and a Conjecture of Moser -- P Systems Working in the Sequential Mode on Arrays and Strings -- Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings -- The Power of Maximal Parallelism in P Systems -- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars -- On the Complexity of 2-Monotone Restarting Automata -- On Left-Monotone Deterministic Restarting Automata -- On the Computation Power of Finite Automata in Two-Dimensional Environments -- The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems -- The Boolean Closure of Linear Context-Free Languages -- Context-Sensitive Decision Problems in Groups -- Decidability and Complexity in Automatic Monoids -- Relating Tree Series Transducers and Weighted Tree Automata -- An NP-Complete Fragment of LTL -- From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata -- Words Avoiding -Powers and the Thue–Morse Morphism -- On the Equivalence Problem for E-Pattern Languages Over Small Alphabets -- Complementation of Rational Sets on Countable Scattered Linear Orderings -- On the Hausdorff Measure of ?-Power Languages -- A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages -- Tissue P Systems with Minimal Symport/Antiport. |
| Record Nr. | UNISA-996466343603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation [[electronic resource] ] : 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney
| Unconventional Computation [[electronic resource] ] : 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Bioinformatics Theory of Computation |
| ISBN | 3-540-38594-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Graph Machines and Their Applications to Computer-Aided Drug Design: A New Approach to Learning from Structured Data -- Rational Models of Cognitive Control -- Fault-Tolerance in Biochemical Systems -- Optical Computing and Computational Complexity -- Regular Papers -- If a Tree Casts a Shadow Is It Telling the Time? -- Peptide Computing – Universality and Theoretical Model -- Handling Markov Chains with Membrane Computing -- Approximation Classes for Real Number Optimization Problems -- Physical Systems as Constructive Logics -- On Spiking Neural P Systems and Partially Blind Counter Machines -- Chemical Information Processing Devices Constructed Using a Nonlinear Medium with Controlled Excitability -- Flexible Versus Rigid Tile Assembly -- On Pure Catalytic P Systems -- Mapping Non-conventional Extensions of Genetic Programming -- The Number of Orbits of Periodic Box-Ball Systems -- The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem -- 1/f Noise in Elementary Cellular Automaton Rule 110 -- A Light-Based Device for Solving the Hamiltonian Path Problem -- Optimizing Potential Information Transfer with Self-referential Memory -- On the Power of Bio-Turing Machines -- Ergodic Dynamics for Large-Scale Distributed Robot Systems. |
| Record Nr. | UNISA-996465577203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation [[electronic resource] ] : 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Mario de Jesus Pérez-Jiménez, Grzegorz Rozenberg
| Unconventional Computation [[electronic resource] ] : 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Mario de Jesus Pérez-Jiménez, Grzegorz Rozenberg |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 267 p.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Bioinformatics Theory of Computation |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Using Genetic Algorithms to Evolve Behavior in Cellular Automata -- Quantum Searching Amidst Uncertainty -- Logic Functions of the Genomic Cis-regulatory Code -- Structural DNA Nanotechnology: Molecular Construction and Computation -- Natural Inspiration for Artificial Adaptivity: Some Neurocomputing Experiences in Robotics -- Regular Papers -- On Self-assembly in Population P Systems -- A Web-Based P Systems Simulator and Its Parallelization -- Communication Complexity as a Principle of Quantum Mechanics -- On Model-Checking of P Systems -- Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems -- P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P -- Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing -- On Reversible Cellular Automata with Finite Cell Array -- A Computational Model for Self-assembling Flexible Tiles -- On Formulations of Firing Squad Synchronization Problems -- Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems -- On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer -- On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata -- A New Sibling of BQP -- A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays -- Computing by Self-reproduction: Autopoietic Automata -- Lower Bounds on the Computational Power of an Optical Model of Computation -- On Counterfactual Computation. |
| Record Nr. | UNISA-996465837103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation and Natural Computation [[electronic resource] ] : 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 -- September 3, 2015, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen
| Unconventional Computation and Natural Computation [[electronic resource] ] : 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 -- September 3, 2015, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 301 p. 58 illus.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Pattern recognition systems Artificial intelligence Theory of Computation Automated Pattern Recognition Artificial Intelligence |
| ISBN | 3-319-21819-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Unconventionality of Nature: Biology, from Noise to Functional Randomness -- Ultrametric Algorithms and Automata -- Realism and Texture: Benchmark Problems for Natural Computation -- Quantum Computing Meets the Real World -- BL: A Visual Computing Framework for Interactive Neural System. Models of Embodied Cognition and Face to Face Social Learning -- Computations with Grossone-based Infinities -- Exploring the Effect of Cell Heterogeneity in Wound Healing Using a 3D Multicellular Tissue Growth Model -- Regularized Linear and Nonlinear Autoregressive Models for Dengue Confirmed-Cases Prediction -- Asynchronous Spiking Neural P Systems with Structural Plasticity -- Expressive Power of Non-Deterministic Evolving Recurrent Neural Networks in Terms of their Attractor Dynamics -- Duplications and Pseudo-Duplications -- Going Beyond Turing with P Automata -- DiSCUS: A Simulation Platform for Conjugation Computing -- A Cost / Speed / Reliability Trade-Off to Erasing -- Replication of Arbitrary Hole-free Shapes via Self-assembly with Signal-passing Tiles -- Efficient Card-based Protocols for Generating a Hidden Random Permutation without Fixed Points -- Simulation of the 2JLP Gene Assembly Process in Ciliates -- A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time -- Asynchronous Dynamics of Boolean Automata Double-Cycles -- Non-cooperative Algorithms in Self-assembly -- Tangle Machines -- Formalisation vs Understanding; A Case Study in Isabelle. |
| Record Nr. | UNISA-996199740703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation and Natural Computation : 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 -- September 3, 2015, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen
| Unconventional Computation and Natural Computation : 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 -- September 3, 2015, Proceedings / / edited by Cristian S. Calude, Michael J. Dinneen |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 301 p. 58 illus.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Pattern recognition systems Artificial intelligence Theory of Computation Automated Pattern Recognition Artificial Intelligence |
| ISBN | 3-319-21819-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Unconventionality of Nature: Biology, from Noise to Functional Randomness -- Ultrametric Algorithms and Automata -- Realism and Texture: Benchmark Problems for Natural Computation -- Quantum Computing Meets the Real World -- BL: A Visual Computing Framework for Interactive Neural System. Models of Embodied Cognition and Face to Face Social Learning -- Computations with Grossone-based Infinities -- Exploring the Effect of Cell Heterogeneity in Wound Healing Using a 3D Multicellular Tissue Growth Model -- Regularized Linear and Nonlinear Autoregressive Models for Dengue Confirmed-Cases Prediction -- Asynchronous Spiking Neural P Systems with Structural Plasticity -- Expressive Power of Non-Deterministic Evolving Recurrent Neural Networks in Terms of their Attractor Dynamics -- Duplications and Pseudo-Duplications -- Going Beyond Turing with P Automata -- DiSCUS: A Simulation Platform for Conjugation Computing -- A Cost / Speed / Reliability Trade-Off to Erasing -- Replication of Arbitrary Hole-free Shapes via Self-assembly with Signal-passing Tiles -- Efficient Card-based Protocols for Generating a Hidden Random Permutation without Fixed Points -- Simulation of the 2JLP Gene Assembly Process in Ciliates -- A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time -- Asynchronous Dynamics of Boolean Automata Double-Cycles -- Non-cooperative Algorithms in Self-assembly -- Tangle Machines -- Formalisation vs Understanding; A Case Study in Isabelle. |
| Record Nr. | UNINA-9910483070403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Models of Computation [[electronic resource] ] : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / / edited by Cristian Calude, Michael J. Dinneen, F. Peper
| Unconventional Models of Computation [[electronic resource] ] : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / / edited by Cristian Calude, Michael J. Dinneen, F. Peper |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (IX, 329 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Bioinformatics Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45833-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The Complexity of Real Recursive Functions -- Hypercomputation in the Chinese Room -- Very Large Scale Spatial Computing -- The Minimum-Model DNA Computation on a Sequence of Probe Arrays -- An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV -- Halting of Quantum Turing Machines -- Filtrons of Automata -- A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction -- Contributed Papers -- Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations -- Implementing Bead-Sort with P Systems -- Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment -- Data Structure as Topological Spaces -- The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computation -- Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata -- Generation of Diophantine Sets by Computing P Systems with External Output -- An Analysis of Computational Efficiency of DNA Computing -- Communication and Computation by Quantum Games -- On the Power of Tissue P Systems Working in the Minimal Mode -- Reversible Computation in Asynchronous Cellular Automata -- General-Purpose Parallel Simulator for Quantum Computing -- Towards Additivity of Entanglement of Formation -- Membrane Computing: When Communication Is Enough -- Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata -- Relativistic Computers and Non-uniform Complexity Theory -- Quantum Optimization Problems -- An Analysis of Absorbing Times of Quantum Walks. |
| Record Nr. | UNISA-996465402103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Models of Computation : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / / edited by Cristian Calude, Michael J. Dinneen, F. Peper
| Unconventional Models of Computation : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings / / edited by Cristian Calude, Michael J. Dinneen, F. Peper |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (IX, 329 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Bioinformatics Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-45833-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- The Complexity of Real Recursive Functions -- Hypercomputation in the Chinese Room -- Very Large Scale Spatial Computing -- The Minimum-Model DNA Computation on a Sequence of Probe Arrays -- An Information Theoretic Approach to the Study of Genome Sequences: An Application to the Evolution of HIV -- Halting of Quantum Turing Machines -- Filtrons of Automata -- A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction -- Contributed Papers -- Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations -- Implementing Bead-Sort with P Systems -- Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment -- Data Structure as Topological Spaces -- The Blob: A Basic Topological Concept for “Hardware-Free” Distributed Computation -- Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata -- Generation of Diophantine Sets by Computing P Systems with External Output -- An Analysis of Computational Efficiency of DNA Computing -- Communication and Computation by Quantum Games -- On the Power of Tissue P Systems Working in the Minimal Mode -- Reversible Computation in Asynchronous Cellular Automata -- General-Purpose Parallel Simulator for Quantum Computing -- Towards Additivity of Entanglement of Formation -- Membrane Computing: When Communication Is Enough -- Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata -- Relativistic Computers and Non-uniform Complexity Theory -- Quantum Optimization Problems -- An Analysis of Absorbing Times of Quantum Walks. |
| Record Nr. | UNINA-9910143896303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||