# Questions tagged [turing-machines]

2020欧洲杯时间表 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.

**1**

**1**answer

### Can a PDA with two stacks accept RE Language?

**0**

**0**answers

### how do I give a detailed description of a turning machine

**0**

**0**answers

### Is regular TM recognizable?

**0**

**1**answer

### Multiplicate two binary numbers in turing machine

**0**

**1**answer

### PDA to Turing machine conversion

**-1**

**2**answers

### Show that the class of decidable languages is closed under the operations of: Complementation, Concatenation, and Intersection

**1**

**0**answers

### What is the prefix of L={⟨M⟩ | M is TM that accepts every palindrome over its alphabet }?

**0**

**0**answers

### Does there exists a language L such that L is decidable, Prefix(L) is also decidable?

**0**

**0**answers

### How do we take the advantage of “infinite language” to avoid repetitions of an enumerating algorithm?

**0**

**1**answer

### Does there exist a regular language that's not Turing Recognizable?

**0**

**0**answers

### How to construct a turing machine for the following language?

**0**

**1**answer

### How Turing machines were built, from the hardware point of view, to read data? And erase?

**1**

**1**answer

### Can I classify a grammar on the basis of comparison of length

**1**

**1**answer

### Proving A Language Is Undecidable Using Turing Reductions

**0**

**0**answers