Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1303-5349-0 |
Объём: | 132 страниц |
Масса: | 221 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! A computational system that can compute every Turing-computable function is called Turing-complete (or Turing-powerful). Alternatively, such a system is one that can simulate a universal Turing machine.A Turing-complete system is called Turing-equivalent if every function it can compute is also Turing-computable; i.e., it computes precisely the same class of functions as do Turing machines. Alternatively, a Turing-equivalent system is one that can simulate, and be simulated by, a universal Turing machine. (All known Turing-complete systems are Turing-equivalent, which adds support to the Church-Turing thesis.)
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.