{"product_id":"9783032156402","title":"Unconventional Computation and Natural Computation : 22nd International Conference, UCNC 2025, Nice, France, September 1-5, 2025, Proceedings (Lecture Notes in Computer Science)","description":"\u003cp\u003eThis book constitutes the proceedings of the 22nd International Conference on Unconventional Computation and Natural Computation, UCNC 2025, held in Nice, France, during September 1-5, 2025.\u003c\/p\u003e\u003cp\u003eThe 24 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 43 submissions. \u003c\/p\u003e\u003cp\u003eThey focus on current important theoretical and experimental results in Molecular computing, Quantum computing, Optical computing, Chaos computing, Physarum computing, Collision-based computing, Self-assembling and self-organizing systems, Super-Turing computation, Cellular automata, Neural computation, Evolutionary computation, Swarm intelligence, Ant algorithms, Artificial immune systems, Artificial life, Membrane computing, Amorphous computing, Computational systems biology, Computational neuroscience, Synthetic biology, Cellular (in-vivo) computing, and other unconventional and natural models of computation with no limitations on their inspiration and origin.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e \u003cp\u003e\u003cstrong\u003e.- Invited Talks.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003e.- Toward non abelian scenarios for Additive Cellular Automata on finite groups.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e.- Regular Papers.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003e.- Reversibility, balance and expansitivity of non uniform cellular automata.\u003c\/p\u003e\u003cp\u003e.- Simulating Virtual Players for UNO without Computers.\u003c\/p\u003e\u003cp\u003e.- Entropy Guarantees for Quantum Boolean Functions.\u003c\/p\u003e\u003cp\u003e.- Balance-Based Cryptography: Physically Computing Any Boolean Function.\u003c\/p\u003e\u003cp\u003e.- Benchmarking the ORCA PT-1 Boson Sampler in Simulation.\u003c\/p\u003e\u003cp\u003e.-  Short and useful quantum proofs for sublogarithmic-space verifiers.\u003c\/p\u003e\u003cp\u003e.- Probabilistic Spiking Neural Networks: Formal Verification and Simulation.\u003c\/p\u003e\u003cp\u003e.-  The domino problem is decidable for robust tilesets.\u003c\/p\u003e\u003cp\u003e.- Creation of fixed points in block-parallel Boolean automata networks.\u003c\/p\u003e\u003cp\u003e.-  Identification of Cellular Automata on Bernoulli Probability Measures.\u003c\/p\u003e\u003cp\u003e.- Symport\/Antiport P Systems with Membrane Separation Characterize P^(#P).\u003c\/p\u003e\u003cp\u003e.- Cellular Automata on Spaces of Probability Measures.\u003c\/p\u003e\u003cp\u003e.-  The Morita Gate is Universal.\u003c\/p\u003e\u003cp\u003e.-  Bridging Chaos Game Representations and k-mer Frequencies of DNA Sequences.\u003c\/p\u003e\u003cp\u003e.-  Machine Learning by Adiabatic Evolutionary Quantum Systems.\u003c\/p\u003e\u003cp\u003e.-  On Time-Varying Insertion-Deletion Systems.\u003c\/p\u003e\u003cp\u003e.- Evaluating ESNs against Lagged Input Regression Computation.\u003c\/p\u003e\u003cp\u003e.-  Determining Isomorphic Crystal Structures.\u003c\/p\u003e\u003cp\u003e.- Enhancing MFCC Feature Extraction Through Reservoir Computing.\u003c\/p\u003e\u003cp\u003e.- Efficient Algorithms for Quantum Hashing.\u003c\/p\u003e\u003cp\u003e.-  Reachability in Interactive Chemical Reaction Networks.\u003c\/p\u003e\u003cp\u003e.- Gakmoro: An Application of Physical Secure Computation to Card Game.\u003c\/p\u003e\u003cp\u003e.- Pattern Graphs of Cellular Automata and Reaction Systems.\u003c\/p\u003e\u003cp\u003e.- Polynomial Simulations of CRN Models with Trimolecular Void Step-Cycle CRNs.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e.- Short Papers.\u003c\/strong\u003e\u003c\/p\u003e\u003cp\u003e.- A Selective Dual-Railing Technique for General-Purpose Analog Computers.\u003c\/p\u003e\u003cp\u003e.-  Partial Information Decomposition of the Radical Pair Spin Dynamics in Avian Magnetoreception Mechanism.\u003c\/p\u003e\u003cp\u003e.- On the Composition of Cellular Automata.\u003c\/p\u003e\u003cp\u003e.- A Comparison of Polynomial-Based Tree Clustering Methods.\u003c\/p\u003e\u003cp\u003e.-  Analog-Hybrid Implementation for Reconfigurable CPGs.\u003c\/p\u003e","brand":"Springer, Berlin; Springer Nature Switzerland; Springer","offers":[{"title":"Default Title","offer_id":48871437566187,"sku":"00000_00000_00000_00000","price":137.32,"currency_code":"SGD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0758\/4484\/5803\/files\/9783032156402-1.jpg?v=1781718098","url":"https:\/\/kinokuniya.com.sg\/products\/9783032156402","provider":"Books Kinokuniya Singapore","version":"1.0","type":"link"}