Time bounded Kolmogorov complexity is the smallest amount of data that can output a given piece of data within a given amount of time.
For this example, Kolmogorov complexity is defined as being able to output the result in an amount of time linearly proportional to the file size. For example, a 64 bit piece of data is allowed twice as much time as a 32 bit piece of data.
Note: I say it is EXPTIME because although you can check the individual result in polynomial/linear time, but you have to check the results below to see if they also output that result in that timeframe. I am not talking about a specific language.