Can we place a lower bound on N to allow the agent to time to parse the problem and become aware of its actions?
Yes, of course that’s allowed. I started out thinking that I could write a program that solved LPP for all N above a certain bound, and then found the obstacle described in section 2.
Yes, of course that’s allowed. I started out thinking that I could write a program that solved LPP for all N above a certain bound, and then found the obstacle described in section 2.