# Thread: Help to create Turning Machine

it reads a string x wich is has letters 1 and 0. For example "01101". The String may be 1 to n letter long. So....the machine reads the string and if the string has 1-s and 0-s in equal number, then machine gives state "true", othervise "false"

For example 1001 = True, 1110 = false

I thank everyone who help me...

2.

3. Dunno what this is about Malick but some thoughts:

1. Turing machine, not Turning (though he may well have tried to turn you, bless him!)

2. Perhaps you could simply have a tape-based counter - write a 1 every time (in reading the string) the head encounters a 1, and erase a 1 every time it encounters a 0. You might have to add that it should start writing 0s should it run out of 1s! At the end of reading the string, it can move on to the tape. If the tape has any 1s, then there are more 1s than 0s. If it is blank, they are equal, and if it has any 0s, then there are more 0s than 1s. Output can then be by whatever means you choose...

4. Originally Posted by MalickT
What is a turning machine

5. The Turing test is a test used to measure the ability of an AI.

http://en.wikipedia.org/wiki/Turing_test

Wiki on Turing machines:
Though they were intended to be technically feasible, Turing machines were not meant to be a practical computing technology, but a thought experiment about the limits of mechanical computation; thus they were not actually constructed
http://en.wikipedia.org/wiki/Turing_machine

6. Originally Posted by Demen Tolden
The Turing test is a test used to measure the ability of an AI.
Good point, but not directly related to the issue of a Turing machine. Alan Turing proposed the idea of a Turing machine to demonstrate, as your quote points out, the logical feasibility of such an algorithmic process being mechanised.

He then further used this idea to define a "Universal Turing Machine", a theoretical construct that could run any logical/mathematical algorithm. He then used this to demonstrate that there are limitations to algorithmic processes, inasmuch as he follows on from results by Godel and Church to show that the "stopping problem" is not mathematically resolvable.

As a different result, or theory, he examined the idea that such machines, or computers (most modern computers are limited forms of Universal Turing Machines, themselves the generalised case of Turing Machines), could be considered to think. He proposed the idea of what he called the Imitation Game (the Wiki link should tell you more about it), which is today called the Turing Test.

A number of authors have written about basic Turing Machines that are specialised to perform a single algorithm, to show how seemingly complex processes (like the one specified by MalickT) can be performed. Douglas Hofstader's famous Godel, Escher and Bach: An Eternal Golden Braid is one such. A more recent example (I was re-reading it so thought of it) is Stephen Pinker's The Language Instinct (or was it How the Mind Works?).

In any case, any solution to MalickT's problem is likely to be along the lines I suggested - though better computer technologists/logicians than I could perhaps point out the various flaws/limitations in my proposal.

cheer

shanks

7. Is Turing the guy that designed the test for AI used in Blade Runner, where you ask identical questions to an AI program and to a human?

8. Originally Posted by KALSTER
Is Turing the guy that designed the test for AI used in Blade Runner, where you ask identical questions to an AI program and to a human?
That's what the Imitation Game is about. Alan Turing (who committed suicide in about 1952 because of government harrassment regarding his homosexuality, poor bugger), suggested that a keyboard and some sort of monitor (he was thinking of print-outs) should be used, and that, were a 'computer' to fool the questioner at least 50% of the time (or fool 50% of questioners) into thinking it was the real human (as opposed to the actual 'real human' who was simultaneously taking the test), then there would be no good reason to think it anything but a person (in the philosophical sense of the word).

In Blade Runner, as I remember it, there was more of a set list of questions, the answers to which would determine the nature of the entity being questioned. There are, therefore, at least two key differences from Turing's Test, but I suspect that the Turing Test may have been the inspiration for it.

cheer

shanks

9. Any AI programs been doing well in Turing tests recently? Can some pass the test?

 Bookmarks
##### Bookmarks
 Posting Permissions
 You may not post new threads You may not post replies You may not post attachments You may not edit your posts   BB code is On Smilies are On [IMG] code is On [VIDEO] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are On Terms of Use Agreement