Hey computer super geniuses:

[aePrime]

Show that determining if two Turing machines, M and N, are equivalent is undecidable.

For extra credit, prove either P = NP or P != NP.

[Crazy Guggenheim]

1. Not clearly stated. Put in some commas.

:popcorn: :popcorn: :popcorn:

[DS1]

2. paging English Geniuses, need help with this thread STAT

[aePrime]

6. Two complaints...

and I can't see what the problem is. I must have done something wrong.

[DS1]

9. then I don't understand the question

and should have heeded the title of the thread

[Spinzonner]

3. Not computer, Mathematics

and I thought the DU rules said there would be no math.

[aePrime]

4. Computation is mathematics.

Can't have computers without a lot of math!

Computer Science != programming.

[FloridaPat]

5. Computers only add and subtract the number 1. Everything else is

a variation of that.

[Spinzonner]

7. Computers = electronics

You can do lots of math without computers. They somehow managed for a couple of thousand years - at least.

Turing machines are conceptualized automata. You don't need actual machines to do the exercise.

[Jamastiene]

11. I'm with you. I do enough math homework in PreCalculus Algebra. My brain

can only handle so many numbers in one week.

[LSK]

8. answering extra credit only

P = NP only if N = 1

P != NP if N != 1

PArt 1 : :wtf:

[aePrime]

12. I've got to give you credit for trying

But I meant P and NP as in classes of problems.

Polynomial time problems and non-deterministic polynomial time problems. It was a trick question, because nobody's yet proven the P versus NP problem. It is one of the Clay Institute's Millennium problems.

http://www.claymath.org/millennium/P_vs_NP/

[Crazy Guggenheim]

13. You sure as hell fooled me .........

[ghostsofgiants]

10. Turing Machine...I love their song "Swiss Grid"