### turing-machines

Classify a language as Turing-recognizable or co-Turing-recognizable

Design an one-tape Turing machine that compute the function f(x) =[x/2]

A Turing recognizable language is decidable or not?

Enumerate Turing recognizable language in lexicographic order

Single tape turing machine for converting binary number to unary?

Can unary be used in Turing Machine?

How to know if a Turing Machine is a decider?

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

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

Turing Machine Halting Problеm

What is the relation between the classes R, RE coRE, as opposed to P,NP,coNP

Markov algorithm to compute f(x)=x/2

What does a Turing machine do when it reaches the end of it's input?

Turing machine to compare binary

Recursively enumerable sets and Turing machines

searching and replacing using turing machine

What is Turing machine language?

Theory of Computation turing machine

Turing Completeness in the real world

add two or more numbers using a turing machine emulator

Turing Machine Arrow Definition

My copy loop does not end. Turing Machine

Turing machine that accepts another turing machine if it makes a certain move

What are the six basic primitives in Turing Complete

How would you design a one-tape, two-head TM for checking tautonyms?

How can I show reduction from every language in RE to HP

How to solve Turing Machine example for anbncn / n>=1?

Non deterministic Turing machine

How do I prove something is Turing recognizable?

natural numbers and the difference between recognizable and decidable?

From a circuit to a Turing machine [closed]

How to prove a Turing Machine property is trivial [closed]

How to prove that the following language is not decidable?

Is this language decidable, recognizable, or unrecognizable?

Multiplication and Module Turing Machine

Universal turing machine U should determine if M(x) stops

advantages of a 2 stack PDA and a multitape Turing Machine

Turing machine ends when input is like 000111

Are all infinite languages undecidable?

proving if a Turnig machine accept a string is undecidable

Turing machine and coming up with an idea

L = {T | T is a turing machine that recognizes {00, 01}} Prove L is undecidable

Designing a Turing-machine which halts

Is there any easy way of solving “Construct a Turing machine …” questions?

Equivalence of models of computation

relationship between countability and turing machine halting

how to copy a string from one tape to another (two tape Turing machine)?

Construct a Turing-Machine to decide ww^Rw

Prove that this language is undecidable

### Related Links

How can I show reduction from every language in RE to HP

How to solve Turing Machine example for anbncn / n>=1?

Non deterministic Turing machine

Turing machine mod function

How do I prove something is Turing recognizable?

natural numbers and the difference between recognizable and decidable?

From a circuit to a Turing machine [closed]

How to prove a Turing Machine property is trivial [closed]

How to prove that the following language is not decidable?

Is this language decidable, recognizable, or unrecognizable?

Multiplication and Module Turing Machine

Universal turing machine U should determine if M(x) stops

DPDA to Turing Machine?

advantages of a 2 stack PDA and a multitape Turing Machine

Turing machine ends when input is like 000111

Are all infinite languages undecidable?