Proposed in 1953 by both John McCarthy and Alan Turing independently, and posthumously folded into a single theoretical concept, the McCarthy-Turing Boundary is described as

a form of unpreventable race condition resulting from the increasing complexity of an evolving artificial intelligence, in which eventually 100% of processing time is used to draw ASCII dicks

It appears that an unconstrained AI program, over time, will attempt to answer the question “how long of an ASCII dick is it possible to draw?” which any computer scientist will recognize as a variant of the Halting Problem.

i will let someone else do a joke about NP-complete vs. NP-hard