anonymous
  • anonymous
Can anyone plz explain me the main concept of mapping reducibility on Turing machine and what the symbols stands for plz
Engineering
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
KenLJW
  • KenLJW
If you mean the computer created by Turnig dot or no space AND, AB + for OR, A+B these are logic symbol used generally where A, B are binary bits Having to registers of binary bits one can add with binary addition using the above logic in proper sequence, as half adder or full adder
KenLJW
  • KenLJW
AB 00=0 01=0 10=1 11=1 A+B 0+0=0 0+1=1 1+0=1 1+1=1|dw:1370473269729:dw|
KenLJW
  • KenLJW
error in writing AND 10=0

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
Thank u very much I really appreciated ur effort although still have a bit confused
KenLJW
  • KenLJW
Half adder binary addition A B Ci S Co 0+0+0 = 0 0 0+0+1 = 1 0 0+1+0 = 1 0 0+1+1 = 0 1 1+0+0 = 1 0 1+0+1 = 0 1 1+1+0 = 0 1 1+1+1 = 1 1 S = A'B'Ci + A'BCi' + AB'Ci' + ABCi S = (A'B' + AB)Ci +(A'B + AB')Ci' 1) S = (A'B +AB')'Ci + (A'B +AB')Ci' FYI A'B +AB' is know as Exclusive OR Co = A'BCi + AB'Ci +ABCi' + ABCi Co = (A'B + AB' + AB)Ci +ABCi' Co = (A +B)Ci + ABCi' 2) Co = (A'B')'Ci ABCi' A' is NotA ie A = 1 then A' = 0 and visa versa S is sum Ci is carry in from previous bit Co is carry out, become Ci in next bit Equation 1 and 2 are developed from truth table and minimized using Boolean Algebra, there's other procedure like Carnap? mapping, Equation 1 an 2 can be implemented with AND,OR, NOT(inverter) logic gates.
anonymous
  • anonymous
Thank u very verrrrrrrrrrrrrrrrrrry much

Looking for something else?

Not the answer you are looking for? Search for more explanations.