Scribd Logo
Upload

Welcome to Scribd!

  • Sholomov Lecture #5

    Uploaded by

    Maxim Chepel
    24 views3 pages
    1) The document discusses Turing machines and partial recursive functions. It defines a Turing machine configuration and how it changes recursively over time. 2) It shows that any partial recursive function can be computed by a Turing machine, and vice versa. 3) It then introduces the concept of a universal Turing machine that can simulate any other Turing machine.

    Original Description:

    Original Title

    Sholomov lecture #5

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) The document discusses Turing machines and partial recursive functions. It defines a Turing machine configuration and how it changes recursively over time. 2) It shows that any partial recursive function can be computed by a Turing machine, and vice versa. 3) It then introduces the concept of a universal Turing machine that can simulate any other Turing machine.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    24 views3 pages

    Sholomov Lecture #5

    Uploaded by

    Maxim Chepel
    1) The document discusses Turing machines and partial recursive functions. It defines a Turing machine configuration and how it changes recursively over time. 2) It shows that any partial recursive function can be computed by a Turing machine, and vice versa. 3) It then introduces the concept of a universal Turing machine that can simulate any other Turing machine.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    . . .

    b2 b1 b0 a

    c0 c1 c2 . . .

    @ q )
    (
    j

    < j, a, m, n >, m =

    bi k , n =

    i=0

    ci k i

    i=0

    < j 0 , a0 , m0 , n0 > - .
    j 0 = j 0 (j, a, m, n), a0 = a0 (j, a, m, n), m0 = m0 (j, a, m, n), n0 = n0 (j, a, m, n)
    - .

    j, a, m, n) - t
    Q(t,
    < j, a, m, n >.
    j, a, m, n), M
    (t, j, a, m, n), N
    (t, j, a, m, n)
    A(t,
    :

    j, a, m, n) = j

    Q(0,

    j, a, m, n) = a
    A(0,

    (0, j, a, m, n) = m

    N
    (0, j, a, m, n) = n
    + 1, j, a, m, n) = j 0 (Q(t,
    j, a, m, n), A(t,
    j, a, m, n), M
    (t, j, a, m, n), N
    (t, j, a, m, n))

    Q(t

    + 1, j, a, m, n) = a0 (Q(t,
    j, a, m, n), A(t,
    j, a, m, n), M
    (t, j, a, m, n), N
    (t, j, a, m, n))

    A(t

    (t + 1, j, a, m, n) = n0 (Q(t,
    j, a, m, n), A(t,
    j, a, m, n), M
    (t, j, a, m, n), N
    (t, j, a, m, n))
    N

    j, a, m, n), A(t,
    j, a, m, n), M
    (t, j, a, m, n), N
    (t, j, a, m, n))
    M (t + 1, j, a, m, n) = m0 (Q(t,
    A,
    M
    ,N

    Q,

    - .

    f (x).

    |...|
    | {z }

    q1 x =

    x+1

    q1

    < 1, 1, 0, n(x) >, n(x) =

    x1
    X
    i=0

     x 

    kx 1
    k 1
    k =
    =

    k1
    k 1
    i

    q(t, x)

    x.

    a(t, x), m(t, x), n(t, x)


    1, 1, 0, n(x))
    q(t, x) = Q(t,
    1, 1, 0, n(x))
    a(t, x) = A(t,
    (t, 1, 1, 0, n(x))
    m(t, x) = M
    (t, 1, 1, 0, n(x))
    n(t, x) = N
    .

    t0 - x. t0 = Mt (q(t, x) = 0) -
    .

    q 0 (x) -
    n0 (x) - n .
    q 0 , n0 - .
    q 0 (x) = q(t0 (x), x) n0 (x) = n(t0 (x), x)
    :

    q0 f (x) = | . . . | ,
    | {z }

    f (x)

    ( q0 ).

    f (x)+1

    
     s 

    k f (x) 1
    k 1
    0
    n (x) =
    , f (x) = Ms (n (k)
    = 0)

    k 1
    k 1
    0

    f (x)

    - .

    f (x1 . . . xk ).
    g(n) = f (e1 (n), . . . ek (x))
    n = P k (x1 , . . . xk )
    ei (n) = xi

    ei - .
    g(n) = f (e1 (n), . . . ek (n)) - ,
    .

    g(n)

    - .

    f (x1 , . . . xk ) = g(P (k) (x1 , . . . xk ))


    2

    .
    .
    .

    {a0 , a1 , . . . ai , . . .}
    {q0 , q1 , . . . qj , . . .}
    d {,
    d -
    d = 10 . . . 0

    , ,a0 , . . . ai , . . . , q0 , . . . , qj

    . . .}

    d.

    d = 10, d = 100, d = 1000


    d = 1 0| .{z
    . . 0}, d = 1 0| .{z
    . . 0}
    2i+4

    2j+5

    0 0

    R = qa q a S .

    d = ddddd = 10 . . . 010 . . . 010 . . . 010 . . . 010 . . . 0

    R1 , R2 , . . . Rs

    d = dd . . . d
    :

    k = a(1) . . . a(i1) qa(i) . . . a(p)


    d = d...d...d
    M, k.M (k)

    .
    (

    q1 d d U

    d,

    ( ).

    . .

    You might also like