Give me about one page for an introduction about “undecidable, decidable languag
ID: 3710615 • Letter: G
Question
Give me about one page for an introduction about “undecidable, decidable languagean , and uncountable problem , and turing machine in theory of compition”. The introduction must be about your own word do not copy paste from the internet And if you use source please put it in your own and send me the link for the source Give me about one page for an introduction about “undecidable, decidable languagean , and uncountable problem , and turing machine in theory of compition”. The introduction must be about your own word do not copy paste from the internet And if you use source please put it in your own and send me the link for the source The introduction must be about your own word do not copy paste from the internet And if you use source please put it in your own and send me the link for the sourceExplanation / Answer
undecidable:
A language is undecidable if it is not decidable. An undecidable language maybe a partially decidable language or something else but not decidable. If a language is not even partially decidable , then there exists no Turing machine for that language. A problem that cannot be solved for all cases by any algorithm whatsoever---equivalently, whose associated language cannot be recognized by a Turing machine that halts for all inputs.
decidable :
A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language. it have particular algorithm.
uncountable :
a set is uncountable if its cardinal number is larger than that of the set of all natural numbers. the number of problems is uncountable means that there can be no way to represent all problems finitely (on a piece of paper).
turing machine :
A turing machine consists of a tape of infinite length on which read and writes operation can be performed. The tape consists of infinite cells on which each cell either contains input symbol or a special symbol called blank. It also consists of a head pointer which points to cell currently being read and it can move in both directions. A TM is expressed as a 7-tuple (Q, T, B, ?, ?, q0, B, F) where:
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.