Theory on TrustLang

Theory of computation

Mon, 01 Jan 0001 00:00:00 +0000

The mechanism of the emergence of consciousness in finite state machines

Mon, 13 Jul 2026 00:00:00 +0000

A finite state machine is a mathematical model of computation: an abstract machine that at each moment of time is in exactly one of a finite set of states, and transitions between states occur in response to input signals (events) according to predefined rules. Traditionally, this model is perceived as a primitive formalization, suitable only for recognizing regular languages and implementing rigidly deterministic reactive controllers.

At first glance, such an abstraction seems too primitive to contain artificial intelligence or self-awareness. However, if we consider consciousness not as a static attribute of an individual element, but as an emergent property that arises at the junction of the interaction of millions of automaton transitions, then the boundary between a computing machine and a thinking system with self-awareness turns out to be unexpectedly thin.

Reflections on the Turing machine and the causes of errors in programming languages

Sat, 15 Nov 2025 00:00:00 +0000

A couple of years ago I wrote the article Reflections on structured programming, in which I tried to sort out the misconception that Edsger Dijkstra proved that any algorithm can be built from just three constructs (sequence, selection, loop). Whereas in reality:

This theorem was proved (with conditions and restrictions) by the Italian scientists Böhm and Jacopini, and Dijkstra merely referred to it.
The three mentioned basic algorithmic constructs are insufficient for modern programming (for example, exception handling is required).
The famous criticism of the goto statement by Dijkstra (as well as of the assignment statement, which is always forgotten to mention) was not a strict ban, but merely a recommendation for improving code style, so that programs would be easier to analyze.

And now the time has come to write about some problems of the Turing machine — the fundamental basis of all information technology.

Reflections on structured programming

Sun, 31 Dec 2023 00:00:00 +0000

31 Dec 2023 at 11:53

Initially I wanted to title the article in some provocative way, for example, “How science can turn into religion”, “Trapped in the distortions of the meaning of structured programming” or “What you were not told about structured programming”, but in the end I still kept the current title and I hope it does not irritate the readers. And although the other titles are more clickbaity, nevertheless they still reflect the meaning of the article to a greater extent than the neutral “reflections”.

The problem of logical programming languages

Sat, 09 Jan 2021 00:00:00 +0000

Some time ago I wrote about “International programming in natural languages”, in which I tried to present a worthy goal for an abstract programming language, trying to try on it the role of a link between the world of programmers with computers and non-programmers.

But as a result it turned out that this is not needed in principle, since “non-programmers” simply do not need to learn to write programs. And if such a desire does arise sometimes, then ordinary formalized programming languages are quite enough, of which there are probably already more than ten thousand.