Number of instructions in M must Rice Theorem==

Linear Bounded Automata===== be finite.Output should be Rice theorem states that any non-
A linear bounded automaton is a multi- produced after performing finite trivial semantic property of a
number of steps.It should not be language which is recognized by a
track non-deterministic Turing machine
imaginary, i.e. can be made in real Turing machine is undecidable. A
with a tape of some bounded finite
length. life.It should not require any property, P, is the language of all
complex understanding.Using Turing machines that satisfy that
Length = function (Length of the initial these statements Church proposed property. If P is a non-trivial
input string, constant c) a hypothesis called Church’s property, and the language holding
Turing thesis that can be stated as: the property, Lp , is recognized by
Here,Memory information ≤ c × Input “The assumption that the intuitive Turing machine M, then Lp = {<M> |
information..The computation is notion of computable functions L(M) ∈ P} is undecidable. Property
restricted to the constant bounded can be identified with partial
of languages, P, is simply a set of
area. The input alphabet contains two
special symbols which serve as left
recursive functions .” languages. If any language
end markers and right end markers belongs to P (L ∈ P), it is said that
which mean the transitions neither Non..deterministicturing machine==In
L satisfies the property P.A
move to the left of the left end marker a Non-Deterministic Turing Machine,
property is called to be trivial if
nor to the right of the right end marker for every state and symbol, there are a either it is not satisfied by any
of the tape.A linear bounded group of actions the TM can have. So,
recursively enumerable languages,
automaton can be defined as an 8-tuple here the transitions are not
or if it is satisfied by all recursively
(Q, X, ∑, q0, ML, MR, δ, F) where − deterministic. The computation of a enumerable languages.A non-
non-deterministic Turing Machine is a
trivial property is satisfied by some
 Q is a finite set of states
tree of configurations that can be
recursively enumerable languages
reached from the start configuration.An
 X is the tape alphabet input is accepted if there is at least one
and are not satisfied by others.
Formally speaking, in a non-trivial
 ∑ is the input alphabet node of the tree which is an accept
 q0 is the initial state configuration, otherwise it is not property, where L ∈ P, both the
accepted. If all branches of the following properties hold:
 ML is the left end marker
computational tree halt on all inputs, Property 1 − There exists Turing
 M R is the right end marker the non-deterministic Turing Machine Machines, M1 and M2 that
where M R ≠ M L is called a Decider and if for some recognize the same language, i.e.
 δ is a transition function input, all branches are rejected, the either ( <M1>, <M2> ∈ L ) or (
which maps each pair (state, input is also rejected.A non-
tape symbol) to (state, tape deterministic Turing machine can be <M1>,<M2> ∈ L )Property 2−
symbol, Constant ‘c’) where c formally defined as a 6-tuple (Q, X, ∑, δ, There exists Turing Machines M1
can be 0 or +1 or -1 q0, B, F) where − and M2, where M1 recognizes the
 F is the set of final states Q is a finite set of states language while M2 does not, i.e.
X is the tape alphabet
<M1> ∈ L and <M2> ∈ L.
Differentiate between recognizable ∑ is the input alphabet
and decidable==When we talk δ is a transition function;
about Turing machines (TM) it δ : Q × X → P(Q × X × {Left_shift, Multi-tape Turing Machines have
could accept the input, reject it or Right_shift}). multiple tapes where each tape is
keep computing which is called q0 is the initial state accessed with a separate head. Each
loop.Now a language is B is the blank symbol head can move independently of the
recognizable if and only if a Turing F is the set of final states other heads. Initially the input is on
machine accepts the string, when tape 1 and others are blank. At first, the
the provided input lies in the Universal Turing Machine== first tape is occupied by the input and
language.Also, a language can be Universal Turing Machine is like a the other tapes are kept blank. Next,
recognizable if the TM either "computer" that can compute any the machine reads consecutive
terminates and rejects the string or algorithmic computation that can symbols under its heads and the TM
doesn't terminate at all. This be carried out by any other Turing prints a symbol on each tape and
means that the TM continues with Machine. It achieves this by moves its heads. A Multi-tape Turing
the computing when the provided reading the description of another machine can be formally described as
input doesn't lie in the language. Turing Machine from its input tape. a 6-tuple (Q, X, B, δ, q0, F) where −Q is
Whereas, the language is This description specifies the a finite set of states..X is the tape
decidable if and only if there is a states and transitions of the other alphabet..B is the blank symbol..δ is a
machine which accepts the string Turing Machine and enables the relation on states and symbols where
when the provided input lies in that Universal Turing Machine to δ: Q × Xk → Q × (X × {Left_shift,
language and rejects the string simulate the behavior of the other Right_shift, No_shift })k..where there
when provided input doesn't lie in machine on its own tape..Once the is k number of tapes..q0 is the initial
that language. Universal Turing Machine has read state..F is the set of final states..
Example the description of the other Turing
A = {hM, wi | M is a DFA and w ∈ Machine, it creates a new tape to A multi head Turing machine is a single
L(M)} is decidable. simulate the behavior of the other tape TM having n heads reading
A = {hM, wi | M is a TM and w ∈ machine. The Universal Turing symbols on the same tapeThe heads
L(M)} is recognizable. Machine then reads the input tape are numbered 1 through n and move of
once again, and uses the simulated TM depends upon the state and
Church Turing Thesis :=Turing Turing Machine to compute the symbols scanned by each head.. In
machine is defined as an abstract desired output. The output is then one step all the heads sense the
representation of a computing written onto the output tape, and scanned symbols and move or write
device such as hardware in the Universal Turing Machine independently.
computers. Alan Turing proposed stops..The Universal Turing
Logical Computing Machines Machine is considered one of the
(LCMs), i.e. Turing’s expressions fundamental concepts in computer
for Turing Machines. This was science and is the theoretical
done to define algorithms properly. foundation of modern computing.
So, Church made a mechanical It demonstrates the power of a
method named as ‘M’ for single, general-purpose computing
manipulation of strings by using device and is a testament to the
logic and mathematics.This concept of algorithmic
method M must pass the following computation .
statements: