M-State and N-Color (M-N = 1-1, 2-1, and 1-2) Turing Algorithms Demonstrated via DNA Self-Assembly.

ABSTRACT: The fast and extensive generation of patterns using specific algorithms is a major challenge in the field of DNA algorithmic self-assembly. Turing machines (TMs) are simple computable machines that execute certain algorithms using carefully designed logic gates. We investigate Turing algorithms for the generation of patterns on algorithmic lattices using specific logic gates. Logic gates can be implemented into Turing building blocks. We discuss comprehensive methods for designing Turing building blocks to demonstrate an M-state and N-color Turing machine (M-N TM). The M-state and N-color (M-N = 1-1, 2-1, and 1-2) TMs generate Turing patterns that can be fabricated via DNA algorithmic self-assembly. The M-N TMs require t

SUBMITTER: Raza MT 

PROVIDER: S-EPMC10157656 | biostudies-literature | 2023 May

REPOSITORIES: biostudies-literature