Аноним

Algorithm: различия между версиями

Материал из WEGA
нет описания правки
Нет описания правки
Нет описания правки
 
Строка 1: Строка 1:
'''Algorithm''' --- алгоритм.
'''Algorithm''' — ''[[алгоритм]].''


An '''algorithm''' is a specific set of instructions for carrying out
An '''algorithm''' is a specific set of instructions for carrying out
Строка 9: Строка 9:
is called a '''computation.'''
is called a '''computation.'''


Clearly, each ''Turing machine''constitutes an
Clearly, each ''[[Turing machine]]''constitutes an
algorithm in the intuitive sense. The statement that a Turing machine is a general-enough mathematical model for the intuitive notion of an algorithm is usually referred to as '''Church's thesis'''.
algorithm in the intuitive sense. The statement that a Turing machine is a general-enough mathematical model for the intuitive notion of an algorithm is usually referred to as '''Church's thesis'''.