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.

What is Turing Complete?

What does the expression "Turing Complete" mean? Can you give a simple explanation, without going into too many theoretical details?

theory turing-machines turing-complete
What's a Turing machine?

What is a Turing machine and why do people keep mentioning it? My IBM PC is all I need to …

computer-science theory turing-machines computability
Turing machine vs Von Neuman machine

Background The Von-Neumann architecture describes the stored-program computer where instructions and data are stored in memory and the machine works …

computer-science cpu-architecture turing-machines von-neumann
What is the difference between recursive and recursively enumerable languages

I was wondering what the difference between recursive and recursively enumerable languages is in terms of halting and Turing Machines. …

computer-science theory computation-theory turing-machines formal-languages
Difference between Turing-Decidable and Co-Turing-Decidable

I am really struggling with understanding the difference between these two. From my textbook, it essentially describes the difference by …

theory turing-machines computation-theory
Real world uses of DFA,NFA,PDA and Turing machines

I am now taking a course on Theory of Computation. I can understand the concepts well. I can able to …

finite-automata computation-theory turing-machines
What are the six basic primitives in Turing Complete

I am listening the edX lesson, and the professor stresses that every machine able to perform those six basic primitives …

turing-machines turing-complete
I do not understand the concept of Non Deterministic Turing Machine

I do not the understand the concept of Non Deterministic Turing Machine. I guess I understand the term Non deterministic …

algorithm state turing-machines non-deterministic
Turing machine algorithm to count 0's and write how many there were in binary

I happen to need an algorithm for a turing machine that reads a string of 0's and then writes on …

algorithm binary turing-machines