Learn More
In the appendix of [1], Gurevich defines finite exploration for small-step algorithms which do not interact with the environment. Although satisfying finite exploration is a seemingly weaker property(More)