Travelling Salesman Page #4

---

But how could they possibly

have understood

How their endeavor

would affect the future?

Like if it would result

in international, global...

I don't know...

Cosmic horror?

If society somehow survived

such a catastrophe,

They'd most likely be viewed,

Whether through propaganda

or not, as villains,

Worse than Hitler.

Well, the truth, I think,

lies somewhere in between.

Why don't we shift gears

before he arrives

And discuss if there

are any issues within the body

Of the findings.

I know we applied

our own expertise

To portions of the report

that fit our field,

Often independently

and while our work

Was rigorously examined

throughout the process.

So...

I guess, are there

any questions?

Or issues with anyone's work?

Ultimately, everything

was functional.

But no one has any questions,

comments?

I had a hard time

validating your proof, doctor.

Computationally, on the surface,

it appeared correct.

It was quite elegant, really.

But, upon closer examination,

a potential error...

Really?

I think we all know

it's airtight.

I mean, we made our

nondeterministic processor.

You can hold it in your hand.

It's simply a physical

representation of the algorithm.

To be blunt,

I'm still not convinced

That your final

computation class

Is computable in linear time.

What, are you nervous?

It's right.

We were more than methodical,

rigorous, even.

Review upon review...

It's right.

I agree... The processor

wouldn't compute

What it's computing

if p wasn't equal to np.

That's right.

Let me put it another way.

The mind's flexibility...

Or maybe I should

say performance...

Is dramatically hindered

the more mileage you put on it.

I mean, Christ,

it's basically the theme

- Of hardy's biography.

- Jim...

p=np is the most significant

problem

In theoretical computer science

And mathematical

complexity theory.

Nearly every area of knowledge

is based on the idea

That brute-Force search

is hard, okay?

That it takes a long time.

We just showed that it's easy.

Everything changes.

This could pave the way

for... It's...

When we prove that p=np,

It has to be done right.

Pick a card.

Come on, pick a card.

Remember that

and put it back in the deck.

Okay, now, if I were

a lousy magician, I would...

You are a lousy magician.

The best way to find your card

Would be to go through each

and ask you,

"Is this your card?"

No.

No. And so on.

And this would take forever,

of course.

Imagine a deck

with a million cards.

I couldn't possibly.

Right. Now...

If I had this problem with

our nondeterministic oracle,

I would simply

give it the deck,

And I would say,

"which is the right card?"

Rate this script:0.0 / 0 votes