Tag
This paper formalizes the concept of prompting complexity, which measures the shortest plausible prompt required for a fixed language model to produce a target text or behavior, drawing an analogy to resource-bounded Kolmogorov complexity.