Probably-istic polynomial time

From the (nonserious) paper Lower Bounds for Probably-istic Polynomial Time:

We fill a gap in existing complexity theory by introducing the class of “probably-istic polynomial time” computations, that is, computations that, you know, probably terminate in polynomial time, as far as we know.

More funny papers here.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s