Ryan Peterman

form, memory schemes or whatever.

Look, I'm interested in P versus NP.

This is a question about impossibility.

This is a problem.

We still didn't get closer in this.

The years I've been at it, we are not much closer to showing hardness for anything.

We don't know that multiplication is harder than addition.

It's a basic question.

So this kind of question by itself is certainly not practical.

I mean, it's not clear.

Well, it is a little clear because if you find out assumptions, maybe you can substantiate cryptography on a theorem rather than an assumption.

But anyway...

There are questions in the field that don't directly relate and will not directly relate to implementations of any system.

But they are all part of trying to understand what efficient computation can do and what it cannot.

Or when can you minimize resources of some type and when you cannot and how do different problems relate to each other.

This basic methodology of the field that created some wonderful edifice.

And I would say that we are still in the embryo stage of understanding computation.

Yeah, it happens.

The big ones happen rarely.

I think of science, I mean, realistically, science and math is, you know, a community of ants' work.