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.

### Like this:

Like Loading...

*Related*