Question

In: Computer Science

Are there computational problems that cannot be solved by a digital computer(or any Turing machine)? Give...

Are there computational problems that cannot be solved by a digital computer(or any Turing machine)? Give one example (that is not computable) and intuitively why it cannot be solved by a digital computer.

Solutions

Expert Solution

The answer for the above mentioned question is explained below ::

Yes , there are computational problems which can't be solved by digital computer .

One example for that computational problem which can't be solved by digital computer is taking a program as a input and find whether it goes into infinite loop or not i.e., When we give a program as a input to the digital computer and if we want to know whether the given program goes into infinite loop or not it is computationally impossible by a digital computer to solve .

Explanation for why the above problem is not solved by digital computer ::

Checking whether the input program goes into infinite loop or not will be done with the help of some indication , i.e., like return value which indicates the program has no infinite loop because it terminated successfully and then returned the corresponding return value to indicate the given input has not goes into infinite loop , this is the case when we gave input ( to the digital computer) a program which doesn't goes into the infinite loop , here we gave the input program to the digital computer in such a way that it doesn't goes into infinite loop , by the help of return value mechanism we can able to find that it doesn't goes into infinite loop (here it only happens in the case of programs which really doesn't goes into infinite loop )

When it is not the case , i.e., when we input a program which really goes into infinite loop to the digital computer to check whether the input program goes to infinite loop or not , it doesn't produce any answer because it might think the input program is doing some useful work and the digital computer waits for the return value of the input program to decide whether the input program has infinite loop or not . This waiting for the digital computer doesn't stop if the input program really goes into infinite loop because our digital computer can't conclude the given input program goes into infinite loop after waiting a long time because it may doing some work so our digital computer may wait until the input program returns a value to indicate that the input program does not goes into infinite loop , but it doesn't happen in case of inputs which really goes into infinite loop .

So checking whether the given input program goes into infinite loop or not is computationally impossible to a digital computer .


Related Solutions

Which of the following problems cannot be solved using a proportional relationship? (i) A 30-mile drive...
Which of the following problems cannot be solved using a proportional relationship? (i) A 30-mile drive is about 48.3 kilometers. Approximately how many kilometers is a 60-mile drive? (ii) A gallon of gas costs $3.49 on October 8, 2011 at the Chevron station on the corner of Imola and Soscol. What does 10 gallons of gas cost on that same day at the same station? (iii) A car travels 50 miles in 2 hours in heavy traffic. How long does...
Consider the integral 01e-x2dx Give an explanation for why this integral cannot be solved manually using...
Consider the integral 01e-x2dx Give an explanation for why this integral cannot be solved manually using substitution or integration by parts Estimate this integral using the average of left and right sums, n = 5 (2 decimals)
Can you give me a turing machine for the language c* n b*2n a* n+2 for...
Can you give me a turing machine for the language c* n b*2n a* n+2 for n>=0 . Please give the entire diagram with states, transition function, alphabet. Can use either one-tape or two-tape (both infinite). Describe the logic used to build the machine. Run the TM that accepts for any string of length > 1. Also run for string cbba.
Give turing Machine for L= a*i b*2j a*i b*2j where i,j>=0. Also provide the logic, show...
Give turing Machine for L= a*i b*2j a*i b*2j where i,j>=0. Also provide the logic, show 1 or 2 strings for accept, reject .
Can you Identify KFC operational problems and Can you give suggest whether any of the operation...
Can you Identify KFC operational problems and Can you give suggest whether any of the operation managemengt techniques or concepts to solve the problem?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT