Scribd Logo
Upload

Welcome to Scribd!

  • Sholomov Lecture #1

    Uploaded by

    Maxim Chepel
    35 views4 pages
    The document discusses the mathematical foundations of computer science. It covers topics like Turing machines, their components and functions. Some key concepts explained include the internal and external alphabets of a Turing machine, configurations, partial recursive functions, active zones of configurations, and elementary concepts of Turing programming like composition, superposition and branching of programs.

    Original Description:

    Original Title

    Sholomov lecture #1

    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
    The document discusses the mathematical foundations of computer science. It covers topics like Turing machines, their components and functions. Some key concepts explained include the internal and external alphabets of a Turing machine, configurations, partial recursive functions, active zones of configurations, and elementary concepts of Turing programming like composition, superposition and branching of programs.

    Copyright:

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

    Sholomov Lecture #1

    Uploaded by

    Maxim Chepel
    The document discusses the mathematical foundations of computer science. It covers topics like Turing machines, their components and functions. Some key concepts explained include the internal and external alphabets of a Turing machine, configurations, partial recursive functions, active zones of configurations, and elementary concepts of Turing programming like composition, superposition and branching of programs.

    Copyright:

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

    1. ..

    "
    "
    2. .. " "

    1.1


    A = {a0@
    , a1 , ...ak1 } 
    a0 = 
    Q = {q0 , q1 , ...qr1 }  ( )
    q0 
    q1 
    : qi aj qi0 aj 0 S , S {, , }
     : < , ,
    >.
    : f (P ) A , P A ,
    A  A.
    - , P.
     ,
    .

    1 0 0

    1 0

    @

    .

    Y
    q

    K = XqY , K  .
    1


    f (P ), :
    (
    q0 f (P ), f (P )
    q1 P
    ,

    f (P )

    P
    q1

    1.2

    q0

    1. ()

    M1 : f1 (P )
    M2 : f2 (P )
    :

    M : f2 (f1 (P ))
    M = M1 M2
    f2 (f1 (P )) , f1 (P ) = R
    f2 (R)
    , Q1 Q2 =

    (
    M1
    M2
    (1)

    (2)

    q0 = q1

    (1)

    q1 = q 1

    (2)

    q0 = q0

    (1)

    (1)

    (2)

    (2)

    1
    2
    q0 f1 (P ) = q1 f1 (P )
    q0 f2 (f1 (P )) = q0 f2 (f1 (P ))
    q1 P = q1 P

    1
    2
    P
    f1 (P )
    f2 (f1 (P ))

    2.

    {, } = {"", ""}
    M1 : f1 (P )
    M2 : f2 (P )
    :

    f1 (P )

    =
    f2 (P )
    M = M1 M 2  .
    , Q1 Q2 =
    (
    M1
    M2
    + 4 :

    (1)

    q 1 N q 1
    (1)

    (1)

    q1 q1
    (2)

    q1 q1
    (2)

    (2)

    q1 q 1
    (1)

    (2)

    q0 = q0 = q0
    3.

    M1 : f1 (P )
    M2 : f2 (P )
    M : f1 (P ) f2 (P ). M = M1 M2 . M .
    .

     
    a
    :
    : qa q 0 a0 S
    b
     
     0
    a
    0 a
    q
    q
    S, b
    b
    b

    (a) P , .

     
     

    a
    (b) . q
    q

    a
    a
    (c) f1 (P )
    (d) f2 (P )
    (e) ,
    f2 (P ). .
    4.

    M1 : f1 (P )
    M2 : f2 (P )
    M :
    M q1 P

    (P )

    q0

    (P )

    q0
    (1)

    f2 , f1 . M0 : P P ; q1 P q0 P q0 = q0

    M M0

    M1 M2 , =

    f1 (P )

    M1 M2 , =
    (2)

    q1 = q 0

    f2 (P )

    You might also like