Stack Overflow
Stack Overflow

Questions tagged [turing-machines]

A Turing machine is an idealized model of computation consisting of a finite-state control, an infinite tape holding information, and a read head positioned somewhere over the tape. Turing machines are used in computability theory to reason about the limits of computation, to provide a formal definition for an algorithm, and to provide formal models for nondeterminism.

Wiki

A Turing machine is a device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer.

Turing machines are not physical objects but mathematical ones. A Turing machine is a kind of state machine. At any time the machine is in any one of a finite number of states. Instructions for a Turing machine consist in specified conditions under which the machine will transition between one state and another.

The tape is used to store data. In addition, it can also store a series of transitions (a small programs) and thus, the head can run sub-programs. By analogy with modern computers, the tape is the memory and the head is the microprocessor.

Tag usage

The tag can be used for programming related problems in implementing features of a turing machine. The tag can also be used for algorithmic problems related to turing machine. Try to avoid theoretical and research based questions on Stack Overflow.

Please note https://cstheory.stackexchange.com is another stack exchange website which you can use to ask theoretical and conceptual problems with tag

Source

487 questions
0
votes
1 answer

Complexity slowdown for stored program computer

The Wikipedia page on Turing machines states that a universal Turing machine is slower than the machines it simulates by at most a log factor. I was curious - what is the equivalent in real life, comparing a pure hardware solution (non stored…
Andrew
  • 6,295
  • 11
  • 56
  • 95
0
votes
2 answers

Data mining termin "fledged"?

Please tell what is termin "full fledged KI"? As i understand it is part of data mining for text analyzing. Am i right? Some interesting and useful links will be fine! Thank you!!!
Edward83
  • 6,664
  • 14
  • 74
  • 102
0
votes
3 answers

Improving performance for a TM simulator

I am trying to simulate a lot of 2 state, 3 symbol (One direction tape) Turing machines. Each simulation will have different input, and will run for a fixed number of steps. The current bottleneck in the program seems to be the simulator, taking a…
spyr03
  • 864
  • 1
  • 8
  • 27
0
votes
2 answers

Is it possible to Estimate RAM needed from Turing space complexity?

Turing machines can consider complexity in both space (memory space on tapes) and time. There are classes such as PSPACE and EXPSPACE. Further, we can present algorithms that are definitely in…
Rick
  • 103
  • 1
0
votes
1 answer

Scanning and running multiple inputs in one run

I am trying to code the basic functions of a Turing machine. So far, the program takes user input and stores it into a List as shown below: public String cmdLoop() { Scanner getReq = new Scanner( System.in ); for( ; ; ) { …
Alex Wan
  • 5
  • 3
0
votes
1 answer

constructing a non deterministic turing machine

Draw the diagram of a two tape Non deterministic Turing Machine M that decides the language L={w∈Σ* | w=uuu ∈Σ* } if i could get help explaining the steps how to construct the NDTM (linguistically), I believe I could draw the diagram but I couldnt…
Ataman
  • 2,530
  • 3
  • 22
  • 34
0
votes
0 answers

What elements does a turing complete programming language need to consist of?

I've been looking for this but came to nothing. I saw this explanation once in some of the python's book out there but i don't remember which one. So, what elements(variable, loop, branching, etc) a programming language should consist of being a…
Scarlett
  • 9
  • 6
0
votes
1 answer

Is there a way to get an accepted input from a Turing Machine?

So say I build a Turing Machine that takes an input of 11(0|1)*0, as in only with that input will it end in an accepting state, is there any algorithms you know of to pull that accepted input from the Turing Machine?
Afropenguinn
  • 35
  • 5
0
votes
1 answer

turing machine design 0 and 1

f1(1^n01^m) = 1^|m−n| design a turing machine that computes the function (transition diagram) how to keep track of the 0 in the middle? I have tried to do it but can not figure it out
king of school
  • 1
  • 1
0
votes
1 answer

What's The Mapping Reduction Function

This is (I think) easy problem from Complexity Theory. #Consider the language E over the binary alphabet #consisting of strings representing even non-negative #integers (with leading zeros allowed). #I.e. E = {x | x[-1] == '0'}. # #Reduce E to…
user6713148
0
votes
1 answer

Can the halting prοblem be sοlved for certain finite functions?

It is my understanding that for a sufficiently simple function, let's say function(boolean input){ while(input){ } } it is possible to tell if it will halt for any possible input. It is easy to see that the above function will terminate for…
Mr. Negi
  • 154
  • 1
  • 15
0
votes
2 answers

{ | M is TM that accept 3 words } (|L(M)|=3)

I'm stuck with this problem { | M is a TM that accepts 3 words} I know how to solve |L(M)|>3 or |L(M)|<3 but when it comes to |L(M)|=3 , I don't know how to proceed!
Mohammad Da
  • 7
  • 6
0
votes
1 answer

A language that is RE complete with respect to polynomial-time reductions?

Is there any language in RE that is complete with regard to polynomial-time reductions? I think that A_TM will be a good example,but I'm not sure...
ChikChak
  • 936
  • 19
  • 44
0
votes
1 answer

decidable languages (Computational Models)

I need to prove whether L is decidable or not: L={ | M is a TM and the union of L(M) and H_TM is in RE} ( H_TM={ | M is a TM that halts on w} )
ChikChak
  • 936
  • 19
  • 44
0
votes
1 answer

What formalism doesn't belong and which are more powerful/equal

I have this list of formalisms and i need to order them according to their expressive power, also one of them doesn't really belong. Context-free Grammar(CFG) Deterministic Finite Automata(DFA) Deterministic Pushdown Automata(DPDA) LR(0)…
Conviley
  • 131
  • 2
  • 10
1 2 3
…
32 33