ट्युरिङ्ग मशीन

ट्युरिङ्ग मशीन गणनाक एकटा गणितीय मॉडल अछि,^[१] जे एक अमूर्त मशीनक वर्णन करैत अछि। ई मशीन नियमसभक तालिकाक अनुसार टेपक एक पट्टीपर लिखल प्रतीकसभकेँ परिवर्तन करैत अछि। मॉडल सरल होयबाक बावजूद, ई कोनो सेहो कम्प्युटर एल्गोरिदमकेँ कार्यान्वित करबाक क्षमता रखैत अछि।

एहो सभ देखी

सन्दर्भ सामग्रीसभ

↑ Minsky (1967, p. 107) "In his 1936 paper, A. M. Turing defined the class of abstract machines that now bear his name. A Turing machine is a finite-state machine associated with a special kind of environment—its tape—in which it can store (and later recover) sequences of symbols", also Stone (1972, p. 8) where the word "machine" is in quotation marks.

बाह्य जडीसभ

[1] Minsky (1967, p. 107) "In his 1936 paper, A. M. Turing defined the class of abstract machines that now bear his name. A Turing machine is a finite-state machine associated with a special kind of environment—its tape—in which it can store (and later recover) sequences of symbols", also Stone (1972, p. 8) where the word "machine" is in quotation marks.

[१]