Top "Turing-machines" questions

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.

Prove that this language is undecidable

Is the following language L undecidable? L = {M | M is a Turing machine description and there exists an input x …

turing-machines formal-languages
Time complexity versus space complexity in Turing machines

I think defenitions of time complexity and space complexity for Turing machines are identical and I can't differentiate between them. …

algorithm complexity-theory time-complexity turing-machines space-complexity
How to convert a DFA to a Turing machine?

Having the diagram of a DFA, how can I convert it to a Turing Machine? Do I have to find …

theory dfa turing-machines
Turing Machine Implementation in C

I'm studying Turing machines for my course in formal languages ​​theory, the professor recommended a run on the following algorithm …

c turing-machines
Turing Machine to accept strings of prime lengths

I have a homework problem that asks me to describe a program for a non deterministic Turing Machine that accepts …

primes turing-machines primality-test
When is theoretical computer science useful?

In class, we learned about the halting problem, Turing machines, reductions, etc. A lot of classmates are saying these are …

theory turing-machines halting-problem computation
Is a Turing machine a real device or an imaginary concept?

When I am studying about Turing machines and PDAs, I was thinking that the first computing device was the Turing …

theory turing-machines
Why aren't recursively enumerable languages undecidable

This is the definition of decidable from Wikipedia In computability theory, an undecidable problem consists of a family of instances …

computer-science turing-machines formal-languages
How to create a turing machine that serves as function calculator for x^y

I'm studying for a test on Turing machines, and I'm stuck with a problem in which I have to create …

turing-machines
Are all infinite languages undecidable?

I am wondering are all infinite languages undecidable? They must be right, as the TM trying to decide an infinite …

turing-machines computation-theory language-theory