Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Markov's principle, named after Andrey Markov Jr, is a classical tautology that is not intuitionistically valid but that may be justified by constructive means. There are many equivalent formulations of Markov's principle. In the language of computability theory, Markov's principle is a formal expression of the claim that if it is impossible that an algorithm does not terminate, then it does terminate. This is equivalent to the claim that if a set and its complement are both computably enumerable, then the set is decidable.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.