Abstract

We evaluate information processing capacity of a single actin molecule by calculating distributions of logical gates implemented by the molecule via propagating patterns of excitation. We represent a filamentous actin molecule as an excitable automaton network (F-actin automaton). where every atom updates its state depending on states of atoms its connected to with chemical bonds (hard neighbours) and atoms being in physical proximity to the atom (soft neighbours). A resting atom excites if a sum of its excited hard neighbours and a weighted sum of its soft neighbours belong to some specified interval. We demonstrate that F-actin automata implement OR, AND, XOR and AND-NOT gates via interacting patterns of excitation. Gate AND is the most common gate and gate XOR is the rarest. Using the architectures of gates discovered we implement one bit half-adder and controlled-not circuits in the F-actin automata. Speed and space values of the F-actin molecular computers are discussed.

Highlights

  • We evaluate information processing capacity of a single actin molecule by calculating distributions of logical gates implemented by the molecule via propagating patterns of excitation

  • We demonstrate that filamentous actin (F-actin) automata implement OR, AND, XOR and AND-NOT gates via interacting patterns of excitation

  • We studied excitation dynamics of actin automata with only hard neighbourhoods, see ref.17, here we discuss dynamics of automata with hard and soft neighbourhoods

Read more

Summary

Andrew Adamatzky

We evaluate information processing capacity of a single actin molecule by calculating distributions of logical gates implemented by the molecule via propagating patterns of excitation. We demonstrate that F-actin automata implement OR, AND, XOR and AND-NOT gates via interacting patterns of excitation. We speculated that a computation in actin filaments could be implemented with travelling patterns of excitation. We implemented computing schemes in several families of actin filament models, from quantum automata to lattice with Morse potential. To evaluate information processing capacity of an actin molecule we decided to calculate distributions of logical gates implemented by the molecule via propagating patterns of excitation. 2 we design an actin molecule model in automaton network where nodes takes excited, refractory and resting states and update their states depending on states of their neighbours.

Methods
Dynamics of Excitation
Boolean Gates
Discussion
Additional Information
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call