Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1313-1041-6 |
Объём: | 120 страниц |
Масса: | 203 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! A recursively enumerable set can be characterized as one for which there exists an algorithm that will ultimately halt when a member of the set is provided as input, but will continue indefinitely when the input is a non member. It was the development of computability theory (also known as recursion theory) that provided a precise explication of the intutitive notion of algorithmic computability, thus making the notion of recursive enumerability perfectly rigorous. It is evident that Diophantine sets are recursively enumerable. This is because one can arrange all possible tuples of values of the unknowns in a sequence and then, for a given value of the parameter(s), test these tuples, one after another, to see whether they are solutions of the corresponding equation.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.