My project concerns fundamental research,
namely theoretical computer science,
and what theoretical computer science does
– briefly speaking – it tries to design fast algorithms
or to prove that in some cases 
we can not design fast algorithms.
My field investigates computational models.
Such a typical, I can even say – famous – application 
of this theory is automatic error verification,
and – shortly speaking – this is detecting 
some kind of bugs in programs automatically.
How do we do it?
We can approximate program by computational model,
and we can, for example, prove a theorem
that if there is some computation 
which starts from initial configuration
and then it goes to some configuration 
which is an error,
for example it exceeds a memory,
then there is also some short computation 
leading to this error configuration.
And if, in some case, we have such a theorem,
then we can design an efficient algorithm
which tests whether for this program such 
an error is possible.
This is a well-known application, 
but this is not why I do my research.
I do it because I believe that understanding 
fundamental nature of computation
is an important thing.
I believe that maybe, 
if we will build, as a community,
a consistent theory of how computation works,
in 30 or 50 years, 
if it will have some important application,
maybe some connection to, for example,
astrophysics, biology or other fields of science.
Summarising, I do my research
because I believe that I can contribute 
to an understanding of the Universe.
