Biocomputers 1

V. Gritsak-Groener

Abstract


This article contains the main results. 1) There exist a DNKA-RNA mechanism X such that for all NP-full problems p: (i) p are solved; (ii) ? pIp is solved in polynomial computational time. 2) There exist a 2-Band Linear Cellular Automata (2LCA) such that for all NP#-full problems q: (iii) q is solved in polynomial computational time.


Keywords


computer; genome; cellular automata; matroid; category; NP-complexis

Full Text:

PDF

References


Gritsak V. V. (Gritsak–Groener V. V.). // Proc. Nat. Acad. Sci. Ukraine SSR, ser. A, N6(1990)68.

Groener W. (Gritsak–Groener V. V.). Fundamental of Mathematical Cybernetics. MIT PRESS, 2004.

Gritsak-Groener V.V., Gritsak-Groener J. Arts Combinatoria. — Charkiv, NTU “ChPI”, 2003.

Alberts B., Bray D., Lewis J., Raff M., Roberts K., Watson J.D. Molecular biology of the cell. — New York, Garland Publishing, Inc., 1989.

Gritsak V. V. (Gritsak–Groener V. V.). Algorithms of Mathematical Chemistry. Preprint IK87-21. — Kyjiv, 1987.

Gritsak V. V. (Gritsak–Groener V. V.). Mathematical Chemistry. — SVITOZIR, Kyjiv, 1993.

Gritsak V. V. (Gritsak–Groener V. V.). // Proc. Nat. Acad. Sci. Ukraine SSR, ser. A, N7(1990)72.

Gritsak V. V. (Gritsak–Groener V. V.). Pattern Recognition Algorithms of Information in Hereditarely Al-phabets Languages. Algprithms an software. 1984. — Kyjiv, 1985.

Gritsak V. V. (Gritsak–Groener V. V.). Combinatorial-Geometry Optimization Problems for Elementary Toposes,// Proceedings Republican Seminary “Discrete Optimisatin”.1985, IK AN Ukraine, Kyjiv, (1985) 31.

Gritsak V. V. (Gritsak–Groener V. V.). // Visnyk Schevtshenko National University, ser. phys.-math. science, N1(1993)5.

Valery V.Gritsak–Groener, Julia Gritsak–Groener, Hamid R. Arabnia, Superpower Computational Creation for Biological Computing, Proceedings of the 2005 International Conference on Scientific Computing, Las Vegas, Nevada, USA June 20-23, 2005, pp.184-190.


Refbacks

  • There are currently no refbacks.