Automata and Computability

Describe two different Turing machines, M and N, where, when started on any input, M outputs N and N outputs M.

Automata and Computability (A128)

Show that the function K (x) is not a computable function.

Automata and Computability

Show that, if P = NP then every language A  P except A = 0 and A = * is NP-complete. See attached for full problem description.

Automata and Computability

Describe the error in the following fallacious “proof” that P  NP. Consider an algorithm for SAT: “On input , try all possible assignments to the variables. Accept if any satisfy .” This algorithm clearly requires exponential time. Thus SAT has exponential time complexity. Therefore SAT is not in P. Because SAT is in NP, it must be true that P is not equal to NP.

Java Program - need to create GUI in three different steps

I have posted my JAVA inventory program so far. I need to do 3 more versions of this. I have been using JDK 1.5 to create my programs and will need help with the following versions using this same version. I put enough credits for all three problems as I feel the same person helping me along with this would be easiest, but I can break it down into 3 separate submissions if you want. I’m definitely struggling with JAVA so I need some guidance on the GUI! The file attached isn't quite what it needs to be. According to my teacher - "I need only one new feature. I don't want to include the restocking fee and item fee in the constructor. Use the method to calculate the restocking fee to add to... click for more