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.
Computing with New Resources [[electronic resource] ] : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday / / edited by Cristian S. Calude, Rūsiņš Freivalds, Iwama Kazuo
| Computing with New Resources [[electronic resource] ] : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday / / edited by Cristian S. Calude, Rūsiņš Freivalds, Iwama Kazuo |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXI, 473 p. 96 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Quantum computers Algorithms Theory of Computation Formal Languages and Automata Theory Quantum Computing |
| ISBN | 3-319-13350-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Counting With Probabilistic and Ultrametric Finite Automata -- Systolic Automata and P Systems -- Soliton Automata with Multiple Waves -- On Power Series over a Graded Monoid -- Advances on Random Sequence Generation by Uniform Cellular Automata -- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages -- Aspects of Reversibility for Classical Automata -- A Weakly Universal Cellular Automaton in the Pentagrid with Five States -- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem -- Time-Optimum Smaller-State Synchronizers for Cellular Automata -- Computing Boolean Functions via Quantum Hashing -- Complexity of Promise Problems on Classical and Quantum Automata -- Quantum Complexity of Boolean Matrix Multiplication and Related Problems -- Quantum Distributed Computing Applied to Grover's Search Algorithm -- Maximally Entangled State in Pseudo-Telepathy Games -- Quantum Finite Automata: A Modern Introduction -- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture -- From Quantum Query Complexity to State Complexity -- Small Universal Devices -- A Technique to Obtain Hardness Results for Randomized Online Algorithms -- Integral Difference Ratio Functions on Integers -- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources -- Symmetries and Dualities in Name-Passing Process Calculi -- Learning from Positive Data and Negative Counterexamples -- One-Sided Random Context Grammars -- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory? -- On Evolutionary Approximation of Logic Circuits -- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems -- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds -- P Systems with Anti-Matter -- A Robust Universal Flying Amorphous Computer -- Minimal Reaction Systems Defining Subset Functions -- Grand Challenges of Informatics -- Konrad Zuse's Relationship to Informatics. |
| Record Nr. | UNISA-996211265703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing with New Resources [[electronic resource] ] : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday / / edited by Cristian S. Calude, Rūsiņš Freivalds, Iwama Kazuo
| Computing with New Resources [[electronic resource] ] : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday / / edited by Cristian S. Calude, Rūsiņš Freivalds, Iwama Kazuo |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXI, 473 p. 96 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Quantum computers Algorithms Theory of Computation Formal Languages and Automata Theory Quantum Computing |
| ISBN | 3-319-13350-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Counting With Probabilistic and Ultrametric Finite Automata -- Systolic Automata and P Systems -- Soliton Automata with Multiple Waves -- On Power Series over a Graded Monoid -- Advances on Random Sequence Generation by Uniform Cellular Automata -- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages -- Aspects of Reversibility for Classical Automata -- A Weakly Universal Cellular Automaton in the Pentagrid with Five States -- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem -- Time-Optimum Smaller-State Synchronizers for Cellular Automata -- Computing Boolean Functions via Quantum Hashing -- Complexity of Promise Problems on Classical and Quantum Automata -- Quantum Complexity of Boolean Matrix Multiplication and Related Problems -- Quantum Distributed Computing Applied to Grover's Search Algorithm -- Maximally Entangled State in Pseudo-Telepathy Games -- Quantum Finite Automata: A Modern Introduction -- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture -- From Quantum Query Complexity to State Complexity -- Small Universal Devices -- A Technique to Obtain Hardness Results for Randomized Online Algorithms -- Integral Difference Ratio Functions on Integers -- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources -- Symmetries and Dualities in Name-Passing Process Calculi -- Learning from Positive Data and Negative Counterexamples -- One-Sided Random Context Grammars -- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory? -- On Evolutionary Approximation of Logic Circuits -- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems -- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds -- P Systems with Anti-Matter -- A Robust Universal Flying Amorphous Computer -- Minimal Reaction Systems Defining Subset Functions -- Grand Challenges of Informatics -- Konrad Zuse's Relationship to Informatics. |
| Record Nr. | UNINA-9910484445503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
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. | UNINA-9910484260603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
In Memoriam, Solomon Marcus
| In Memoriam, Solomon Marcus |
| Autore | Calude Cristian S |
| Pubbl/distr/stampa | Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 |
| Descrizione fisica | 1 electronic resource (148 p.) |
| Soggetto topico |
Information technology industries
Computer science |
| Soggetto non controllato |
automata theory
formal language theory bio-informatics recursive function theory evolutionary processor network of evolutionary processors network topology theory of computation computational models intrinsic perception Hausdorff dimension fractal computational complexity Turing machine oracle Turing machine shortest computations quasiperiod formal language asymptotic growth polynomial membrane computing computational complexity theory P vs. NP problem evolutional communication symport/antiport Kolmogorov complexity random strings extractors finite languages deterministic finite cover automata multiple entry automata automata with “do not care” symbols similarity relations process calculus communication patterns control structures hypergraph model P systems cP systems NP-complete NP-hard SAT logarithmic time complexity |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910566467603321 |
Calude Cristian S
|
||
| Basel, : MDPI - Multidisciplinary Digital Publishing Institute, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Rainbow of Computer Science [[electronic resource] ] : Essays Dedicated to Hermann Maurer on the Occasion of His 70th Birthday / / edited by Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa
| Rainbow of Computer Science [[electronic resource] ] : Essays Dedicated to Hermann Maurer on the Occasion of His 70th Birthday / / edited by Cristian S. Calude, Grzegorz Rozenberg, Arto Salomaa |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XII, 285 p. 69 illus., 39 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory User interfaces (Computer systems) Human-computer interaction Artificial intelligence Computers and civilization Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory User Interfaces and Human Computer Interaction Artificial Intelligence Computers and Society |
| ISBN | 3-642-19391-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmics -- Improved Approximations for Hard Optimization Problems via Problem Instance Classification -- Covering and Packing with Spheres by Diagonal Distortion in Rn -- Counting Plane Graphs with Exponential Speed-Up -- Formal Languages and Automata -- Ancient Typefaces and Parametric Weighted Finite Automata -- On Language Decompositions and Primality -- Ancient Typefaces and Parametric Weighted Finite Automata -- On Language Decompositions and Primality -- A Unifying Kleene Theorem for Weighted Finite Automata -- Local Squares, Periodicity and Finite Automata -- P and dP Automata: A Survey -- On the General Coloring Problem -- Learning -- Transdisciplinary Collaboration and Lifelong Learning: Fostering and Supporting New Learning Opportunities -- Towards an Open Learning Infrastructure for Open Educational Resources: Abundance as a Platform for Innovation -- Why E-Learning as It Stands Is Not Enough -- The Practice of Informatics -- Domains: Their Simulation, Monitoring and Control—A Divertimento of Ideas and Suggestions -- Roots and Stimuli to a New Perception of Informatics -- Towards a New Shape Description Paradigm Using the Generative Modeling Language -- Name Resolution by Rewriting in Dynamic Networks of Mobile Entities -- Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings -- TGV-Fusion -- Secure and Privacy-Preserving eGovernment—Best Practice Austria -- The Quest for Uncertainty. |
| Record Nr. | UNISA-996465905103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation [[electronic resource] ] : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings / / edited by Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg
| Unconventional Computation [[electronic resource] ] : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings / / edited by Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 247 p. 76 illus., 13 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Bioinformatics Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Computational and Systems Biology |
| ISBN | 3-642-21341-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465609903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| 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] ] : 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. | UNINA-9910483757503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
