[grads] special sem.2PM, thurs, Michael Fellow, P versus NP

[Manfred Warmuth]

2PM Thursdsay, June 16

BASKIN ENGINEERING BLDG,
Seminar ROOM 265
(Graduate Student Library)

speaker: Mike Fellows,
Univ. of Newcastle (Australia)
Computer Science Dept.

Title: P versus NP and all that,
for a mathematician.

Abstract: The P and NP question is worth a million dollars. What's that
all about? How to explain this question to a pure mathematician,
somebody in topology or analysis?

Theoretical computer science is pretty new and in many ways unsettled.
How would you explain the P and NP question and other central mysteries
of the big picture that theoretical computer science has the mission of
exploring, in one short and hopefully memorable hour?

That's the charter of this gentle survey introduction to the central
questions of theoretical computer science, as one might tell the story to
a pure mathematician.

Some other unsolved problems that lie "beyond" P vs NP, specifically the
parameterized complexity central question of FPT vs W will be touched
upon.

[4mus...@gmail.com]

Let N be a floating value from a set of non-zero integers where N+1=P, and P represents the set of all but all but one of the prime numbers. Let NP represent the only prime number both not contained in P and not equal with any value of N. Then let NP+1 not equal all but one of the set of composite numbers, and NP-1 not equal all but one of the set of prime numbers.