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
-1
votes
1 answer

Construct TM that will accepts the language L = {0i0j0k/ i < j < k}

How to Construct a Turing Machine that will accepts the language L = {0i0j0k/ i < j < k}.
sarika venugopal
  • 1
-1
votes
1 answer

Recursively Decidable language, acceptance of infinite language

So it is my understanding that Recursively Decidable languages are the languages that we can build a Turing Machine such that given an input w from that language, Turing Machine will always either accept and halt or reject and halt. What I am…
Saik
  • 993
  • 1
  • 16
  • 40
-1
votes
1 answer

Accept 2 strings with same length using turing machine

This problem is asked in NET exam. can you please tell me how to solve this problem. Problem is accept two string with same length. I wnat answer in {turing machine table like q0==> [q0,b,a] } this format. shubhadaa
shubhadaa
  • 1
  • 1
-1
votes
1 answer

Implementing a queue by Turing machine

How can I implement queue by Turing machine?
Eyal
  • 1
-1
votes
1 answer

Enumerate Turing recognizable language in lexicographic order

So a Turing recognizable language is also enumerable. But is it possible for an enumerator to "print" a Turing recognizable language in lexicographic order?
PTN
  • 1,658
  • 5
  • 24
  • 54
-1
votes
1 answer

Why decider D behaves the opposite when it is using decider H as a subroutine?

Acoordind to paragraph shown, how decider D uses H as a subroutine and how it is behaving the opposite ? It would be very useful if someone clarify this ?
Garrick
  • 677
  • 4
  • 15
  • 34
-1
votes
3 answers

Theory of Computation. Turing Machine

Click here for the answer. Turing Machine The question is to construct a Turing Machine which accepts the regular expression, L = {a^n b^n | n>= 1}. I am not sure if my answer is correct or wrong. Thank you in advance for your reply.
kylas
  • 1,425
  • 6
  • 24
  • 38
-1
votes
1 answer

Reduction from ATM to ATM-co

Is there a reduction from ATM to ATM-complement? I have been thinking about it too much and couldn't find the answer. I know that reduction from ATM-complement to ATM is not possible becouse if it was, ATM would not be in RE. But how can I…
Dvir Samuel
  • 13
  • 10
-1
votes
1 answer

Non deterministic Turing machine

I am new to NDTM, but I do understand the concept of a turing machine. when it comes to NDTM I get a little confused, I m supposed to develop a NDTM for language {a,b,c} and L = {w ∈ Σ*| Ǝv ∈ Σ*, Ǝn >= 2 with w = v (to the power of) n } First…
S. N
  • 3,456
  • 12
  • 42
  • 65
-2
votes
1 answer

What is the most concise way to generate strings of language anbncn using JavaScript without using loops?

To convey the merits of Lambda Calculus, and even JavaScript's ability to implement such (Turing-complete) formulas, I'd like to see the most elegant and concise way that one JS file could print the correct string of the following language, given a…
Benjamin Paige
  • 1
  • 2
-2
votes
1 answer

Number of Turing Machines?

Do you have any idea about this question? I do not know what it asks. -What is the number of Turing machines with with the state set of (Q-start, Q2, Q3, Q4, Q5, Q6, Q-accept, Q-reject),input alphabet(0,1)and tape alphabet (0,1,x,U) where U is the…
MadMax
  • 306
  • 1
  • 5
  • 17
-2
votes
1 answer

What is theorem of arrest?

Someone mentioned it to me as something important related to the Turing machine but I can't find anything related to such theorem anywhere... Can someone help me or is the said theorem with the wrong name?
Tsui
  • 44
  • 5
-2
votes
1 answer

Turing machine for palindrome

Describe TM with one tape and two tape, which decide language сonsisting of palindrome (words have only '1' and '0' symbols). Estimate time of work each TM.
marka_17
  • 201
  • 1
  • 2
  • 7
-2
votes
4 answers

Recursively enumerable sets and Turing machines

Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? (A) L2 – L1 is recursively enumerable. (B) L1 – L3 is recursively enumerable (C)…
user6120086
-2
votes
1 answer

Specifying members of a given sequence with a Turing Machine

One question I came across was, given a binary sequence a_0, ..., a_{n-1} how many transitions does it take such that when given a non-negative integer i it outputs a_i if i < n and 0 otherwise. You can assume the input starts with a 1 unless i is…
ruler501
  • 197
  • 1
  • 1
  • 12
1 2 3
…
32
33