Theory and Practice of Natural Computing

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.

[1]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[2]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[3]  Rani Siromoney,et al.  Circular DNA and Splicing Systems , 1992, ICPIA.

[4]  Andrés Weintraub,et al.  Use of OR Systems in the Chilean Forest Industries , 1999, Interfaces.

[5]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[6]  Shinnosuke Seki.  Combinatorial Optimization in Pattern Assembly , 2013, ArXiv.

[7]  E. Winfree,et al.  Robust self-replication of combinatorial information via crystal growth and scission , 2012, Proceedings of the National Academy of Sciences.

[8]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Andres Weintraub,et al.  A Truck Scheduling System Improves Efficiency in the Forest Industries , 1996 .

[10]  J. R,et al.  Analog Stable Simulation of Discrete Neural Networks , 1997 .

[11]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[12]  Matthew J. Patitz,et al.  Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes , 2013, UCNC.

[13]  Marcel Paul Schützenberger,et al.  On the Synchronizing Properties of Certain Prefix Codes , 1964, Inf. Control..

[14]  Jirí Wiedermann,et al.  Theory of neuromata , 1998, JACM.

[15]  Jiřı́ Šı́ma.  Energy Complexity of Recurrent Neural Networks , 2014, Neural Computation.

[16]  Wenyan Liu,et al.  Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced Tile Assembly Model , 2011, Natural Computing.

[17]  Stefan Irnich,et al.  Vehicle Routing Problems with Inter-Tour Resource Constraints , 2008 .

[18]  Erik Winfree,et al.  Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly , 2003, DNA.

[19]  Erik Winfree,et al.  Integrating DNA strand-displacement circuitry with DNA tile self-assembly , 2013, Nature Communications.

[20]  Michael Drexl,et al.  Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints , 2012, Transp. Sci..

[21]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[22]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[23]  Erik Winfree,et al.  DNA as a universal substrate for chemical kinetics , 2009, Proceedings of the National Academy of Sciences.

[24]  S Mazzeo,et al.  AN ANT COLONY ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM , 2004 .

[25]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[26]  Pekka Orponen,et al.  General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results , 2003, Neural Computation.

[27]  Erik Winfree,et al.  Self-replication and Evolution of DNA Crystals , 2005, ECAL.

[28]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..