The creation and study of various formal models for computers and computational algorithms is very important for understanding the true nature of universal computations. This analysis may result in new approaches for constructing computers of the future (quantum, genetic, molecular or others). The research on limitations of these formal models provides a deeper understanding of the capabilities of present-day and future computers. The present review considers the classic Turing model of computations and the contemporary models of biomolecular computations based on molecular recombination operations (splicing-operations).

universal computations, universal Turing machine, biomolecular computations, computational algorithms

Mathematical problems and theory of numerical methods