Scribd
Upload
42 views

Undecidability

Uploaded by

fakersspot.1412
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
42 views

Undecidability

Uploaded by

fakersspot.1412
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 10
BAPATLA WOMEN’S ENGINEERING COLLEGE::BAPATLA DETAILED LECTURE NOTES FacultyName: ub/eode: Department: SE UNDEcIDRBITY Page.No:.1.: DY rhe Lessing Machine hatte fo -Ktnal date, tren lhe hein | fs cxceeples| im Qa Latvemy Machrne | <\nc my Machine Nnatle Rerrall ecthen bbe glen, | 9 Yre wan chine Vhattc tin nen: dlale a. 4 -bb, Vimeo Machine. ees vy" . ‘ (e vege 7 alin 68 enleed (nie file loo, den Wee Me GL Wwe Ser i i ‘6 atceplet wn Bee. ee -ltn) de Reeeeve qotd te be wemrae, ie py Lampage © | cous Wivog, Maddie ~ va halle tm Birch dat we oS pene tine date, wv oe o we rerfo sp ctoen” 4 ha\ ww Sk ‘ @ Scanned with OKEN Scanner I {Rerarsively Enumerable Lemguage (REL) @ \ te be wsecuvsively Enumerabl, a y % fx Language “Ui Sat Lertmy lb deme Lassi Machene “MW Such-thar ‘ a 4 en MY hallt tr Frnal slate MM Ww ts ~E-b. a. alate w vw Sh a chen “MS halle fo rnon—ter a) feonclonartne wacksne a7 erlc, teks ofyrnnle bop, cork dewde whetherWbe A we inthe Gn Ws He, we Lanepsege Aes) neh. > Dre Langege “te vce cursive Wen tbe pation Clee able 3 & Vos AK pelos gotd 4 Ye decidable, shee easly Some Dept A ov! , ° 19 Sroele ono of tree \oe “dest yadaeln SOM Moc povon 7 + pene gerber a dad to bd Ware Lanageage ay REET en a . ne . ann be tyndetdabl, epee tad Boma. alt 4 of tame, hum AA ° _ Ane Hele HE yaw aolves Ave ge Byumerable. Languages es OL Recursive’ _ ahh Renante Lenqne nner ally ages cue nef- Reurrarue \ae ad weer en rennet @ Scanned with OKEN Scanner BAPATLA WOMEN’S ENGINEERING COLLEGE::BAPATLA DETAILED LECTURE NOTES EacultyName: sub/eode: Department: 9& Dragnaltralist Longuage (Lad: raalac Lanquag, La tea Ofage }r acts be vepricnt “the an, W fe oO Peek ae, ! Vatig, toy mene SS bo Ae Sonn of cranny or Seger ee” ke 0, De Ane &* e cone. Loe wa 4 the Lawn Neetane ee p qeane Grim, EU) cy by La. ig tong © ented %E vast more Od | te Conve*: aria a + ok avin i t spas & 0 FO uch by be \uary a, alwiy fe anep Machine. @ Scanned with OKEN Scanner “Canvendtt ast Wachene. @ 4 . that means M can make no M—| guess about the input string and therefore can not accept M M, This proves that there maiedt a should be such a Turing machine whose lan #6, thus L(M) = Lng Now let us aes ieee? ae undecidable problem in TM. This theorem is called Rice's theorem. Universal Seven Turing Machine — Accept u Theorem : Every non trivial property of RE language is undecidable. Proof: Property of a language is a set of strings for which the Turing machines can be drawn which ultimately represents certain class. For example, a property of "context free language" in TM contains all the codes for the Turing machine M such that all the L(M) are context free languages. Let P be any non trivial property of RE languages. That means atleast one language has the property and atleast one language does not. Initially we will assume $ an empty language is not having the property P. As P is the non trivial, there should be some language L having property P ie. L L, and therefore there exists a coded TM accepting language L. Let us call such TM as My, Let us reduce a universal language L, to L, and as. L, is undecidable L,, is also undecidable. The Turing machine M’ can be produced on reduction. For the reduction algorithm the pair (M,w) can be given as input. Basically M’ is a two-tape Turing machine such that * One tape is used to simulate TM M for the input w. Then input (M,w) is used for designing the transitions of M’. * The second tape is used to simulate My on input x. Again a pair (M’, x) is used to build the transitions of M’. The TM M’ does the following things - 1. The Turing machine M is simulated for the input w. Then TM M’ acts as a universal Turing machine by accepting the pair (M, w). 2. There exists two cases either M accepts w or M does not. If M accepts w then M’ does nothing else. M’ cannot have its own input x, in such case L(M’) = >. But as we have assumed ¢ is not in property P that also means code for M’ is not in Lp. 3. If M accepts w then M’ simulates M, for its own input x and hence M’ actually accepts the language of My, In other words, M’ accepts the language L. But the language L is having the property P, therefore the code for M’ is in Lp. TECHNICAL PUBLICATIONS”. An up trust for knowledge ——— : a & Scanned with OKEN Scanner Formal Languages & Automata Theory 8-11 Computability Theory 4, From above three steps we cannot decide whether code for M’ is in Lp. This proves that property P is undecidable. Now there exists another possibility that if is in P then P’is a set of languages not having property P. As P is Accept undecidable P” is also undecidable. But there is Turing machine which accepts a recursively enumerable language Lp;- The language Lp, is actually : a set of turing machine code. These codes actually accept the language having property P. Even such set of languages is same as the set of TM codes. that eae a set of languages having property P’. If at all Lp is decidable then L’p is also decidable. Turning M' Fig, 8.4.1 (b) @ Scanned with OKEN Scanner & Automata Thoory 7-60 Formal Languages, [Bl Church's Hypothesis Hypothesis means proposing certain facts, The church's hypothesis or church's Turin can be stated as, B Turing Maching thesis “The assumption that the intuitive notion of computable functions can be identified vith partial recursive functions", However, this hypothesis can not be proved. The computability of recursive functions js based on following assumptions - 1) Each elementary function is computable. 2) Let f be the computable function and g be the another function which can be obtained by applying an elementary operation to f, then g becomes a computable function. 3) Any function becomes computable if it is obtained by rule 1) and 2). Counter Machine : ‘A counter machine can be represented by following model - AN. E e 7 Fig. 7.9.1 Counter Machine There are two ways of representing counter machine - 1. The counter machine is similar to 4 multistack Turing Machine, But the only difference between them is that in Place of each stack there is a counter. The counters contain non negative intege!: Each move of counter machine depends on its state, input symbol, In one move counter machine can : i) Change state ii) Add or subtract 1 from any of its counters. The negative counters are not allowed at all. Teonnuca puaucaTions”* Ap trust or kroweeoe @ Scanned with OKEN Scanner Formal Languages & Automata Theory 7-61 Turing Machine 2. The counter machine is similar to restricted multistack machine. These restrictions are - i) There are only two stack symbols : Zy and X. ii) The Zg is the bottom of stack marker. It is initially on each stack. iii) Replace Zp only by string of the form ez where i 2 0. iv) Replace X only by x! for i> 0. ie. The Zy appears on the bottom of each stack, and all other stack symbols are X. There are two important observations about the counter machine. 1. Every language accepted by a counter machine is recursively enumerable. 2. Every language accepted by one counter machine is a context free language. @ Scanned with OKEN Scanner

You might also like