Algebro-algorithmic aspects of completeness: Abstractions, biology, and ecology

Authors:
G. E. Tseitlin
Affiliations:
Institute of Program Systems, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2008

Citing 4
Cited 0

Go¨del's incompleteness theorem

Theoretical Computer Science
Generative programming: methods, tools, and applications

Generative programming: methods, tools, and applications
Glushkov Algebras and Clone Theory

Cybernetics and Systems Analysis
Transformational reducibility and synthesis of algorithms and programs of symbolic processing

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using means of the algebra of algorithmics, the relation between the well-known Godel and Post theorems is established. An approach to the description of actual subject domains is analyzed as applied to the following triad: abstraction, biology, and programming ecology. This approach is also actively developed in the West.