1 / 7

TURING MAKİNELERİ

TURING MAKİNELERİ. Yılmaz Kılıçaslan. Sunum Planı. Turing makinelerinin tanımı Örnekler Tartışma ve sonuç. Turing’in Tanımı.

brady-boyer
Download Presentation

TURING MAKİNELERİ

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. TURING MAKİNELERİ Yılmaz Kılıçaslan

  2. Sunum Planı Turing makinelerinin tanımı Örnekler Tartışma ve sonuç

  3. Turing’in Tanımı • ...an unlimited memory capacity obtained in the form of an infinite tape marked out into squares, on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter the scanned symbol and its behavior is in part determined by that symbol, but the symbols on the tape elsewhere do not affect the behaviour of the machine. However, the tape can be moved back and forth through the machine, this being one of the elementary operations of the machine. Any symbol on the tape may therefore eventually have an innings. (Turing 1948, p. 61)

  4. Formel Bir Turing Makinesi Tanımı Bir Turing makinesi şu yedi bileşenden oluşur: Q: Boş olmayan bir sonlu durum kümesi Γ: Boş olmayan bir simge kümesi / alfabe b ϵ Γ: boşluk sembolü ∑ ⊆Γ \ {b}: Giriş simgelerini içeren küme q1: Başlangıç durumu F ⊆Q: Son durumları içeren küme δ: Q \ F x Γ  Q x Γ x {L, R}, geçiş fonksiyonu (L ve R, sırasıyla bir adım sola ve bir adım sağa kayma simgeleridir).

  5. Örnek: Üç S1 yazma S0:S1 S0:S1 S0:S1 S1:L S1:L q3 q1 q2

  6. Örnek: 1’lerin sayısını ikiye katlama 0:R 1:L 1:R 0:R 1:L q6 q7 q8 q9 0:L q1 1:L q2 q3 q4 0:L q10 1:L 0:L q5 0:L 0:L 1:L 1:L 1:0 0:1 0:1 1:R 1:R q11 1:L 0:R q12

  7. Kaynak • Turing, A.M. (1936). "On Computable Numbers, with an Application to the Entscheidungs problem". Proceedings of the London Mathematical Society. 2 42. • Alan Turing, 1948, "Intelligent Machinery." Reprinted in "Cybernetics: Key Papers." Ed. C.R. Evans and A.D.J. Robertson. Baltimore: University Park Press, 1968.

More Related