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.
Developments in language theory : 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004 : proceedings / / [Cristian S. Calude, Elena Calude, Michael J. Dinneen (eds.)]
| Developments in language theory : 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004 : proceedings / / [Cristian S. Calude, Elena Calude, Michael J. Dinneen (eds.)] |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2004 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 005.13/1 |
| Altri autori (Persone) |
CaludeCristian <1952->
CaludeElena DinneenM. J. <1957-> |
| Collana | Lecture notes in computer science |
| Soggetto topico | Formal languages |
| 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. |
| Altri titoli varianti | DLT 2004 |
| Record Nr. | UNINA-9910484260603321 |
| Berlin ; ; New York, : Springer, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003, proceedings / / Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki, editors
| Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003, proceedings / / Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki, editors |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2003] |
| Descrizione fisica | 1 online resource (309 p.) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Combinatorial analysis
Computational complexity |
| ISBN |
1-280-80451-3
9786610804511 3-540-45066-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Two Philosophical Applications of Algorithmic Information Theory -- Covering and Secret Sharing with Linear Codes -- Combinatorial Problems Arising in SNP and Haplotype Analysis -- Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey -- Generating Gray Codes in O(1) Worst-Case Time per Word -- Contributed Papers -- Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems -- Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata -- On the Order Dual of a Riesz Space -- A Finite Complete Set of Equations Generating Graphs -- ECO Method and the Exhaustive Generation of Convex Polyominoes -- Regular Expressions with Timed Dominoes -- On Infinitary Rational Relations and Borel Sets -- Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems -- On Functions and Relations -- Paths Coloring Algorithms in Mesh Networks -- Finite State Strategies in One Player McNaughton Games -- On Algebraic Expressions of Series-Parallel and Fibonacci Graphs -- Boolean NP-Partitions and Projective Closure -- On Unimodality of Independence Polynomials of Some Well-Covered Trees -- A Coloring Algorithm for Finding Connected Guards in Art Galleries -- An Analysis of Quantified Linear Programs -- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique -- On the Monotonic Computability of Semi-computable Real Numbers. |
| Record Nr. | UNISA-996465957403316 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2003] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003, proceedings / / Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki, editors
| Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003, proceedings / / Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki, editors |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2003] |
| Descrizione fisica | 1 online resource (309 p.) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Combinatorial analysis
Computational complexity |
| ISBN |
1-280-80451-3
9786610804511 3-540-45066-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Two Philosophical Applications of Algorithmic Information Theory -- Covering and Secret Sharing with Linear Codes -- Combinatorial Problems Arising in SNP and Haplotype Analysis -- Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey -- Generating Gray Codes in O(1) Worst-Case Time per Word -- Contributed Papers -- Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems -- Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata -- On the Order Dual of a Riesz Space -- A Finite Complete Set of Equations Generating Graphs -- ECO Method and the Exhaustive Generation of Convex Polyominoes -- Regular Expressions with Timed Dominoes -- On Infinitary Rational Relations and Borel Sets -- Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems -- On Functions and Relations -- Paths Coloring Algorithms in Mesh Networks -- Finite State Strategies in One Player McNaughton Games -- On Algebraic Expressions of Series-Parallel and Fibonacci Graphs -- Boolean NP-Partitions and Projective Closure -- On Unimodality of Independence Polynomials of Some Well-Covered Trees -- A Coloring Algorithm for Finding Connected Guards in Art Galleries -- An Analysis of Quantified Linear Programs -- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique -- On the Monotonic Computability of Semi-computable Real Numbers. |
| Record Nr. | UNINA-9910767536803321 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2003] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude
| Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (466 p.) |
| Disciplina | 519.23 |
| Altri autori (Persone) |
CaludeCristian <1952->
ChaitinGregory J |
| Soggetto topico |
Kolmogorov complexity
Computational complexity Stochastic processes |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-91160-7
9786611911607 981-277-083-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents; Preface; Technical Contributions; 1. On Random and Hard-to-Describe Numbers Charles H. Bennett; 1. Berry's Paradox and the Unprovability of Randomness; 2. The Search for a "Random" Real Number; References; 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Francoise Chaitin-Chatelin; 2.1. Introduction; 2.2. Nonassociativity of multiplication; 2.3. Nonassociative Dickson algebras; 2.3.1. Presentation of Dickson's doubling process; 2.3.2. Alternative vectors in Ak, k 4; 2.3.3. The splitting Ak = CDC;1 Dk, k 2
2.4. SVD computation in Dk and Ak, k 32.4.1. c 2 Dk is doubly pure, k 4.; 2.4.2. Deriving the SVD of a in Ak from that of the tail c in Dk, for k 4; 2.4.3. Nonclassical derivation from c to a, k 3; 2.5. Is the nonclassical SVD derivation absurd?; 2.5.1. The conventional analysis; 2.5.2. Induction and nonclassical singular values; 2.6. Conclusion; Acknowledgement; References; 3. Janus-Faced Physics: On Hilbert's 6th Problem N. C. A. da Costa and F. A. Doria; 3.1. Prologue; 3.2. Hilbert's 6th Problem; 3.3. A review of axiomatization techniques 3.4. Structures, species of structures, models 3.5. Axiomatization in mathematics; 3.6. Suppes predicates for classical field theories in physics; 3.7. Generalized incompleteness; 3.8. Higher degrees; 3.9. The function and the arithmetical hierarchy; 3.10. First applications: mechanics and chaos theory; 3.11. Janus-faced physics; Acknowledgments; References; 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P. C. W. Davies; 4.1. What are the laws of physics?; 4.2. Laws as software; 4.3. The quantum vacuum 4.4. Quantum information processing 4.5. Unfinished business; Acknowledgments; Footnotes; 5. What Is a Computation? Martin Davis; The Turing - Post Language; Codes for Turing - Post Programs; The Universal Program; The Halting Problem; Other Unsolvable Problems; Undecidable Statements; Complexity and Randomness; Unsolvability of Halting Problem; An Unsolvable Word Problem; 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil; References; 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles; 7.1. Introduction 7.2. Computing through signals 7.2.1. A three states CA by Banks; 7.3. CA over a hexagonal grid and three states; 7.4. Life automata; 7.4.1. Game of life; 7.4.2. Life without death; 7.5. Reversible models; 7.6. Sandpiles; 7.7. Conclusions; Acknowledgments; References; 8. Chaitin's Graph Coloring Algorithm James Goodman; References; 9. A Berry-type Paradox Gabriele Lolli; References; 10. in Number Theory Toby Ord and Tien D. Kieu; 10.1. Recursive Enumerability, Algorithmic Randomness and ; 10.2. Diophantine Equations and Hilbert's Tenth Problem 10.3. Expressing Omega Through Diophantine Equations |
| Record Nr. | UNINA-9910450885903321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude
| Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (466 p.) |
| Disciplina | 519.23 |
| Altri autori (Persone) |
CaludeCristian <1952->
ChaitinGregory J |
| Soggetto topico |
Kolmogorov complexity
Computational complexity Stochastic processes |
| ISBN |
1-281-91160-7
9786611911607 981-277-083-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents; Preface; Technical Contributions; 1. On Random and Hard-to-Describe Numbers Charles H. Bennett; 1. Berry's Paradox and the Unprovability of Randomness; 2. The Search for a "Random" Real Number; References; 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Francoise Chaitin-Chatelin; 2.1. Introduction; 2.2. Nonassociativity of multiplication; 2.3. Nonassociative Dickson algebras; 2.3.1. Presentation of Dickson's doubling process; 2.3.2. Alternative vectors in Ak, k 4; 2.3.3. The splitting Ak = CDC;1 Dk, k 2
2.4. SVD computation in Dk and Ak, k 32.4.1. c 2 Dk is doubly pure, k 4.; 2.4.2. Deriving the SVD of a in Ak from that of the tail c in Dk, for k 4; 2.4.3. Nonclassical derivation from c to a, k 3; 2.5. Is the nonclassical SVD derivation absurd?; 2.5.1. The conventional analysis; 2.5.2. Induction and nonclassical singular values; 2.6. Conclusion; Acknowledgement; References; 3. Janus-Faced Physics: On Hilbert's 6th Problem N. C. A. da Costa and F. A. Doria; 3.1. Prologue; 3.2. Hilbert's 6th Problem; 3.3. A review of axiomatization techniques 3.4. Structures, species of structures, models 3.5. Axiomatization in mathematics; 3.6. Suppes predicates for classical field theories in physics; 3.7. Generalized incompleteness; 3.8. Higher degrees; 3.9. The function and the arithmetical hierarchy; 3.10. First applications: mechanics and chaos theory; 3.11. Janus-faced physics; Acknowledgments; References; 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P. C. W. Davies; 4.1. What are the laws of physics?; 4.2. Laws as software; 4.3. The quantum vacuum 4.4. Quantum information processing 4.5. Unfinished business; Acknowledgments; Footnotes; 5. What Is a Computation? Martin Davis; The Turing - Post Language; Codes for Turing - Post Programs; The Universal Program; The Halting Problem; Other Unsolvable Problems; Undecidable Statements; Complexity and Randomness; Unsolvability of Halting Problem; An Unsolvable Word Problem; 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil; References; 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles; 7.1. Introduction 7.2. Computing through signals 7.2.1. A three states CA by Banks; 7.3. CA over a hexagonal grid and three states; 7.4. Life automata; 7.4.1. Game of life; 7.4.2. Life without death; 7.5. Reversible models; 7.6. Sandpiles; 7.7. Conclusions; Acknowledgments; References; 8. Chaitin's Graph Coloring Algorithm James Goodman; References; 9. A Berry-type Paradox Gabriele Lolli; References; 10. in Number Theory Toby Ord and Tien D. Kieu; 10.1. Recursive Enumerability, Algorithmic Randomness and ; 10.2. Diophantine Equations and Hilbert's Tenth Problem 10.3. Expressing Omega Through Diophantine Equations |
| Record Nr. | UNINA-9910777315303321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional computation : 8th international conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009 : proceedings / / Cristian S. Calude ... [et al.] (eds.)
| Unconventional computation : 8th international conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009 : proceedings / / Cristian S. Calude ... [et al.] (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XXI, 293 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | CaludeCristian <1952-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer science
Soft computing |
| ISBN | 3-642-03745-3 |
| Classificazione |
BIO 110f
DAT 500f DAT 719f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks and Tutorials -- Using Physical Experiments as Oracles -- A Tutorial on Analog Computation: Computing Functions over the Reals -- Computational Mechanics: Natural Computation and Self-organization -- Diophantine Equations and Computation -- Structure of Reversible Cellular Automata -- Brain Dynamics Promotes Function -- Awakening the Analogue Computer: Rubel’s Extended Analog Computer Workshop -- Artifice, Interpretation and Nature: Key Categories in Radiology Work -- Developmental Computing -- Evolvable Hardware: From Applications to Implications for the Theory of Computation -- Relativistic Computers and Transfinite Computation -- Regular Contributions -- Turing Completeness Using Three Mobile Membranes -- Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer -- Networks of Evolutionary Picture Processors with Filtered Connections -- Mapping Computation with No Memory -- Real Computable Manifolds and Homotopy Groups -- Distributed Quantum Programming -- Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy -- Random Number Selection in Self-assembly -- Abstract Geometrical Computation and Computable Analysis -- Descriptional Complexity of Tissue-Like P Systems with Cell Division -- Computing Domains of Attraction for Planar Dynamics -- Approximating the Behaviours of Physarum polycephalum for the Construction and Minimisation of Synthetic Transport Networks -- Simulation of Neurocomputing Based on Photophobic Reactions of Euglena: Toward Microbe–Based Neural Network Computing -- Reasoning about Entanglement and Separability in Quantum Higher-Order Functions -- On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory -- Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer -- Membrane Dissolution and Division in P -- Computing Naturally in the Billiard Ball Model -- Posters -- Water as a Quantum Computing Device -- Cloning for Heteroscedasticity Elimination in GMDH Learning Procedure -- Tug-Of-War Model for Two-Bandit Problem -- Intrusion Detection in Circular Frustrated Systems: An Eminently Parallel Processing Algorithm -- NMR-Based Encoding and Processing of Alphanumeric Information. |
| Altri titoli varianti | UC 2009 |
| Record Nr. | UNINA-9910483371103321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation [[electronic resource] ] : 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings / / edited by Christian S. Calude, Jose Felix Gomes da Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg
| Unconventional Computation [[electronic resource] ] : 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings / / edited by Christian S. Calude, Jose Felix Gomes da Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 259 p.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Bioinformatics Theory of Computation Computational and Systems Biology |
| ISBN | 3-540-85194-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Quantum Experiments Can Test Mathematical Undecidability -- Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids -- Predictions for the Future of Optimisation Research -- Immune Systems and Computation: An Interdisciplinary Adventure -- Regular Contributions -- Distributed Learning of Wardrop Equilibria -- Oracles and Advice as Measurements -- From Gene Regulation to Stochastic Fusion -- A Biologically Inspired Model with Fusion and Clonation of Membranes -- Computing Omega-Limit Sets in Linear Dynamical Systems -- The Expressiveness of Concentration Controlled P Systems -- On Faster Integer Calculations Using Non-arithmetic Primitives -- A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies -- The Role of Conceptual Structure in Designing Cellular Automata to Perform Collective Computation -- A Characterisation of NL Using Membrane Systems without Charges and Dissolution -- Quantum Wireless Sensor Networks -- On the Computational Complexity of Spiking Neural P Systems -- Self-assembly of Decidable Sets -- Ultrafilter and Non-standard Turing Machines -- Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder -- Automata on Multisets of Communicating Objects. |
| Record Nr. | UNISA-996465644503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation : 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings / / edited by Christian S. Calude, Jose Felix Gomes da Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg
| Unconventional Computation : 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings / / edited by Christian S. Calude, Jose Felix Gomes da Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 259 p.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Bioinformatics Theory of Computation Computational and Systems Biology |
| ISBN | 3-540-85194-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Quantum Experiments Can Test Mathematical Undecidability -- Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids -- Predictions for the Future of Optimisation Research -- Immune Systems and Computation: An Interdisciplinary Adventure -- Regular Contributions -- Distributed Learning of Wardrop Equilibria -- Oracles and Advice as Measurements -- From Gene Regulation to Stochastic Fusion -- A Biologically Inspired Model with Fusion and Clonation of Membranes -- Computing Omega-Limit Sets in Linear Dynamical Systems -- The Expressiveness of Concentration Controlled P Systems -- On Faster Integer Calculations Using Non-arithmetic Primitives -- A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies -- The Role of Conceptual Structure in Designing Cellular Automata to Perform Collective Computation -- A Characterisation of NL Using Membrane Systems without Charges and Dissolution -- Quantum Wireless Sensor Networks -- On the Computational Complexity of Spiking Neural P Systems -- Self-assembly of Decidable Sets -- Ultrafilter and Non-standard Turing Machines -- Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder -- Automata on Multisets of Communicating Objects. |
| Record Nr. | UNINA-9910483202603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional computation : 5th international conference, UC 2006, York, UK, September 4-8, 2006 : proceedings / / Cristian S. Calude ... [et al.] (eds.)
| Unconventional computation : 5th international conference, UC 2006, York, UK, September 4-8, 2006 : proceedings / / Cristian S. Calude ... [et al.] (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | CaludeCristian <1952-> |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Soft computing
Computer science |
| 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. |
| Altri titoli varianti | UC 2006 |
| Record Nr. | UNINA-9910483757503321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional computation : 4th international conference, UC 2005, Sevilla, Spain, October 3-7, 2005 : proceedings / / Cristian S. Calude ... [et al.] (eds.)
| Unconventional computation : 4th international conference, UC 2005, Sevilla, Spain, October 3-7, 2005 : proceedings / / Cristian S. Calude ... [et al.] (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XI, 267 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | CaludeCristian <1952-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Soft computing
Computer science |
| 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. |
| Altri titoli varianti | UC 2005 |
| Record Nr. | UNINA-9910484710203321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||