March 6th, 2020. Article by Gints Dreimanis

Learn more about the Serokell scholarship – our contribution to the future of Russian computer technologies.

- March 6th, 2020. Article by Gints DreimanisLearn more about the Serokell scholarship – our contribution to the future of Russian computer technologies.
- May 31st, 2019. Article by Andrey KomarovRandom numbers are used in cryptography, and most of the cryptographic operations use computers. But a computer is a deterministic device, thus, it isn’t able to simply generate a truly random number. There are different approaches to solving the problem, and some of them are worse than others.
- May 10th, 2019. Article by Dmitrii MeinsterThe Turing degree of a set of natural numbers is a concept from computer science and mathematical logic that is a measure of the level of algorithmic unsolvability of the set. This post carries you deeper into the problem of the undecidable languages and the halting problem.
- April 11th, 2019. Article by Nikita LisitsaPerhaps you cannot quite picture how quantum computers work, but you definitely heard something about them. Nowadays, all rich, as well as not-so-rich states and corporations, are trying to build one. However, many face a problem of inability to emulate a large quantum computer. Let us figure out why.

Close