Titlebook: Unconventional Computation and Natural Computation; 16th International C Matthew J. Patitz,Mike Stannett Conference proceedings 2017 Spring

哄骗

休息

Self-assembly of Shapes at Constant Scale Using Repulsive Forcesof the Two-Handed Tile Assembly Model (2HAM), which contains positive (attractive) and negative (repulsive) interactions. As a result, portions of an assembly can become unstable and detach. In this model, we utilize fuel-efficient computation to perform Turing machine simulations for the constructi

Adherent

Self-Assembly of 4-Sided Fractals in the Two-Handed Tile Assembly Modelthe Two-handed Tile Assembly Model (2HAM). We are particularly interested in a class of fractals called discrete self-similar fractals (a class of fractals that includes the discrete Sierpinski’s carpet). We present a 2HAM system that strictly self-assembles the discrete Sierpinski’s carpet with sca

STEER

Self-assembled DC Resistive Circuits with Self-controlled Voltage-Based Growthtach small resistive circuits to a seed to form larger circuits. Component circuits can only attach to the growing circuit if the voltage across the output terminals of the partial assembly exceeds a given threshold. Thus, as the circuit grows, the supply voltage progressively dissipates until addit

使残废

巧办法

Superposition as Memory: Unlocking Quantum Automatic Complexity., .) such that there is a subgroup . of the projective unitary group . with . and with . such that, in terms of a standard basis . and with ., we have . and . for all . with .. We show that . is unbounded and not constant for strings of a given length. In particular, .and ..

阻挡

令人心醉

Universal Matrix Insertion Grammars with Small Size 1, 2, 2) (., having ternary matrices inserting one symbol in two symbol context) can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular language or an intersection with a regular lan

Cardiac

Deduplication on Finite Automata and Nested Duplication Systemstions that iteratively generate new strings from existing strings in the system. As the main result we introduce the concept of a deduplication—a reverse function of duplication—on an nondeterministic finite-state automaton (NFA) and propose the deduplication operation on an NFA that transforms a gi

寄生虫

Descrambling Order Analysis in Ciliates (partial) order on the rearrangement of segments to descramble. Similar to phylogenetic analysis, this prediction can be based on the principle of parsimony, whereby the smallest sequence of operations is likely close to the actual number. The . genome is analyzed, providing evidence that multiple