Turing-recognizable language

Let A be a turing-recognizable language consisting of descriptions of Turing machines, {M1, M2,…}, where every Mi is a decider. Prove that some decidable language D is not decided by any decider Mi whose description appears in A. (Hint: You may find it helpful to consider an enumerator for A.)

NP-Harp

Recall, in our discussion of the Church-Turing thesis, that we introduced the language D = {p | p is a polynomial in several variables having an integral root}. We stated, but didn’t prove, that D is undecidable. In this problem you are to prove a different property of D, namely, that D is NP-hard. A problem is NP-hard if all problems in NP are polynomial time reducible to it, even though it may not be in NP itself. So, you must show that all problems in NP are polynomial time reducible to D.

CONVERT C++ TO JAVA BLUE-J

I have attached the document and several pages from my textbook please convert the traffic program from C++ to JAVA BlueJ. I DON'T NEED THE GRAPHS. HOWEVER, IT SHOULD DISPLAY NUMERICAL FEEDBACK TO THE USER AND ALLOW INPUT FROM USER ALSO.

Find / resolve c program segmental fault

Need some assistance finding / repairing segmentation fault in program. The attached program uses a random number generator, orders numbers hi to low, displays hi number, low number and should display mean and median numbers from random list. I run "./random2 1 100 20" to generate 20 numbers between 1 and 100, (./random2 min max number). My attached program compiles using gcc -Wall -ansi -o random2 Assign2bm.c. However, when I run "./random2 1 100 20" for example it seg faults after displaying largest number and smallest number without displaying mean and median.

iHaul Sales Force Facts and Figures

Information attached.