- Home-icon
- Subjects
- _Automata
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Big Data
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Compiler Desingn
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Computer Organization
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Computer Graphics
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Algorithm
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Computer Networks
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Data Structure
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Discrete
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Machine Learning
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _ML Techniques
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Operating System
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- _Software Engineering
- __Unit-1
- __Unit-2
- __Unit-3
- __Unit-4
- __Unit-5
- MCQ's
- _AUTOMATA
- _Compiler Design
- _COA
- _Machine Learning
- _Software Engineering
- _Operating System
- _Python
- _Web Technology
Showing posts from February, 2022Show all
TAFL Unit-5
Undecidable Problem about Turing Machine
The reduction is used to prove whether given language is desirable or not. In this section, we will understand the concept of reduction first and the…
Read more
TAFL Unit-5
Introduction to Undecidability
In the theory of computation, we often come across such problems that are answered either 'yes' or 'no'. The class of problems which …
Read more
TAFL Unit-5
Post Correspondence Problem
Post Correspondence Problem In this section, we will discuss the undecidability of string and not of Turing machines. The undecidability of the strin…
Read more
TAFL Unit-5
Halting Problem
Note:- To understand better the halting problem, we must know Decidability, Undecidability and Turing machine, decision problems and also a theory na…
Read more
TAFL Unit-5
Recursive and Recursively Enumerable language
Recursive Enumerable (RE) or Type -0 Language RE languages or type-0 languages are generated by type-0 grammars. An RE language can be accepted or re…
Read more
TAFL Unit-5
Church’s Thesis
In 1936, A method named as lambda-calculus was created by Alonzo Church in which the Church numerals are well defined, i.e. the encoding of natural n…
Read more
TAFL Unit-5
Linear Bounded Automata
A linear bounded automaton is a multi-track non-deterministic Turing machine with a tape of some bounded finite length. Length = function (Length of …
Read more
TAFL Unit-5
Universal Turing machine
The Turing Machine (TM) is the machine level equivalent to a digital computer. It was suggested by the mathematician Turing in the year 1930 and has …
Read more
TAFL Unit-5
Examples of TM
Examples of TM Turing Machine for a n b n where n>=1 Turing Machine for a n b n c n where n>=1 Example: Construct a Turing Machine for languag…
Read more
