Simulation of biological cells by systems composed of string-processing finite automata

Authors:
Walter R. Stahl;Robert W. Coffin;Harry E. Goheen
Affiliations:
Oregon State University, Corvallis, Oregon;Oregon Regional Primate Research Center, Beaverton, Oregon;Oregon State University, Corvallis, Oregon
Venue:
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Year:
1964

Citing 6
Cited 0

A Variant to Turing's Theory of Computing Machines

Journal of the ACM (JACM)
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Journal of the ACM (JACM)
Turing Machines, Finite Automata and Neural Nets

Journal of the ACM (JACM)
The computer and the brain

The computer and the brain
The Gödel incompleteness theorem and intelligent machines

AIEE-IRE '62 (Spring) Proceedings of the May 1-3, 1962, spring joint computer conference
Simulation of a Turing machine on a digital computer

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the last few years enormous progress has been made in clarifying the operational mechanisms of living cells. It has been established beyond reasonable doubt that all aspects of cell activity are controlled by sequences of elementary genetic units. A comma-free triplet coding in the four-letter alphabet of DNA is transcribed on RNA and causes the formation of sequences of amino acids, which make up polypeptides and proteins. Various theories of transcription control for such systems are now under study. Recently, synthetic nucleic acid (RNA) chains have been fed into the cell machinery, thus demonstrating that protein synthesis can be controlled artificially. Numerous finer details of the problem could be mentioned (see Crick, Nirenberg, Rich, Waddington, and Anfinsen) but shall not be considered in this report.