Results 1 to 13 of 13

Thread: turing machine :(

Hybrid View

  1. #1

    Thread Starter
    New Member
    Join Date
    Mar 2005
    Posts
    1

    turing machine :(

    im having difficulty in understanding turing machines if anyone can help can they explain to me the following:-
    a turing machine starts off with its read/write head at the leftmost bit of the binary representation of an arbitary numbern, and terminates with its read/write head at the leftmost bit of the binary representation of n + 1.
    thanks in advance

  2. #2
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221

    Re: turing machine :(

    Which part doesn't make sense?
    A turing machine is a state automaton that operates on an infinite tape with a finite amount of symbols, in a finite alphabet, according to a finite instruction set, having a finite amount of states. Each instruction is a cartesian product of these elements:
    input symbol (which is read from the tape)
    output symbol (which is written to the tape)
    the state in which the instruction executes
    the consequent state.
    Right/Left (depending on which direction on the tape the read/write head will move)
    a binary representation of a number, is a number written using only two digits, 0 and 1, where digit n is the number/2^(n-1) modulus 2.
    Use
    writing software in C++ is like driving rivets into steel beam with a toothpick.
    writing haskell makes your life easier:
    reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
    To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

  3. #3
    Frenzied Member
    Join Date
    Jul 1999
    Location
    Huntingdon Valley, PA 19006
    Posts
    1,151

    Re: turing machine :(

    I think a Turing machine can only do a few operations (less than 10-20). Try a Web search to find out what operations are allowed. It should be a lot simpler to understand than the posted description of this hypothetical device.

    Turing proved that his simple machine could do anything that more complicated machines could do. Since it was easier to analyze than a complex device, it could be used to determine the theoretical capabilities of more complex systems.
    Live long & prosper.

    The Dinosaur from prehistoric era prior to computers.

    Eschew obfuscation!
    If a billion people believe a foolish idea, it is still a foolish idea!
    VB.net 2010 Express
    64Bit & 32Bit Windows 7 & Windows XP. I run 4 operating systems on a single PC.

  4. #4
    type Woss is new Grumpy; wossname's Avatar
    Join Date
    Aug 2002
    Location
    #!/bin/bash
    Posts
    5,682

    Re: turing machine :(

    Turing machines are cool but they are very hard to program.
    I don't live here any more.

  5. #5
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221

    Re: turing machine :(

    Quote Originally Posted by Guv
    I think a Turing machine can only do a few operations (less than 10-20). Try a Web search to find out what operations are allowed. It should be a lot simpler to understand than the posted description of this hypothetical device.

    Turing proved that his simple machine could do anything that more complicated machines could do. Since it was easier to analyze than a complex device, it could be used to determine the theoretical capabilities of more complex systems.
    10-20, where did you get that number?
    There should only be one kind of instruction, which looks like this:
    (StateA, StateB, Read, Write, Direction)

    For instance, if I have a tape looking like this:

    [..A,B,C,D..]

    the head is on B, and the TM is in state X,

    and we have this instruction:

    (X,Y,B,E,Right)

    then what follows is

    [..A,E,C,D..]

    the head is now on C, and the TM is in state Y.
    Use
    writing software in C++ is like driving rivets into steel beam with a toothpick.
    writing haskell makes your life easier:
    reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
    To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

  6. #6
    Banned dglienna's Avatar
    Join Date
    Jun 2004
    Location
    Center of it all
    Posts
    17,901

    Re: turing machine :(

    Six operations are allowed.

    * read (i.e. identify) the symbol currently under the head
    * write a symbol on the square currently under the head (after first deleting the symbol already written there, if any)
    * move the tape left one square
    * move the tape right one square
    * change state
    * halt.
    http://www.alanturing.net/turing_arc...20Machine.html

  7. #7
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221

    Re: turing machine :(

    yeah ok, if thats what you mean by operation.. but then again you could have so many more operations...
    Use
    writing software in C++ is like driving rivets into steel beam with a toothpick.
    writing haskell makes your life easier:
    reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
    To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  



Click Here to Expand Forum to Full Width