Question: [15] Consider the following proof for Exercise 6.10.20 without using Kolmogorov complexity: Assume that a PRAM M adds n numbers in o(log n) time. Take

[15] Consider the following ‘proof’ for Exercise 6.10.20 without using Kolmogorov complexity: Assume that a PRAM M adds n numbers in o(log n) time. Take any input x1,...,xn. Then there is an input xk that is ‘not useful’ as in the hint in Exercise 6.10.20.

If we change xk to xk + 1, then the output should still be the same, since xk is not useful, a contradiction. What is wrong with this proof?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Elementary Probability For Applications Questions!