You have unlimited time and resources so you can ‘brute force’ it (try all random combinations until the task is complete)
While technically true I find this to be a confusing way to think...if it would take you 2^100000 operations to brute force, is this really any different from it being impossible?
That would depend on the type of task—for computational tasks a series of planners and solvers do many ‘jobs’ without knowing what it is doing—just minimising a function repeatedly until the right result appears.
They typically aren’t literally trying all combinations though (or if they are, the space of configurations is not too large). In this sense, then, the algorithm does know what it is doing, because it is narrowing down an exponentially large search space to a manageable size.
While technically true I find this to be a confusing way to think...if it would take you 2^100000 operations to brute force, is this really any different from it being impossible?
That would depend on the type of task—for computational tasks a series of planners and solvers do many ‘jobs’ without knowing what it is doing—just minimising a function repeatedly until the right result appears.
They typically aren’t literally trying all combinations though (or if they are, the space of configurations is not too large). In this sense, then, the algorithm does know what it is doing, because it is narrowing down an exponentially large search space to a manageable size.