Comment by cultureulterior 1 year ago For me O1 found this by telling it "There is a further significant optimization possible." 8 comments cultureulterior Reply freehorse 1 year ago What if you keep telling it that "there is a further significant optimization possible"? afiodorov 1 year ago I claim we can do O(1) complexity (minus precompute) in all cases, see another comment of mine. Curious if O1 will figure it out. Dylan16807 1 year ago In that comment, you are generating your own random numbers and then optimizing away the actual generation. It can't take an input array.While clever, I think that strays too far from the initial prompt. 3 replies → ryao 1 year ago Given the problem size is bounded, all solutions for solving this could be considered O(1).
freehorse 1 year ago What if you keep telling it that "there is a further significant optimization possible"? afiodorov 1 year ago I claim we can do O(1) complexity (minus precompute) in all cases, see another comment of mine. Curious if O1 will figure it out. Dylan16807 1 year ago In that comment, you are generating your own random numbers and then optimizing away the actual generation. It can't take an input array.While clever, I think that strays too far from the initial prompt. 3 replies → ryao 1 year ago Given the problem size is bounded, all solutions for solving this could be considered O(1).
afiodorov 1 year ago I claim we can do O(1) complexity (minus precompute) in all cases, see another comment of mine. Curious if O1 will figure it out. Dylan16807 1 year ago In that comment, you are generating your own random numbers and then optimizing away the actual generation. It can't take an input array.While clever, I think that strays too far from the initial prompt. 3 replies → ryao 1 year ago Given the problem size is bounded, all solutions for solving this could be considered O(1).
Dylan16807 1 year ago In that comment, you are generating your own random numbers and then optimizing away the actual generation. It can't take an input array.While clever, I think that strays too far from the initial prompt. 3 replies →
ryao 1 year ago Given the problem size is bounded, all solutions for solving this could be considered O(1).
What if you keep telling it that "there is a further significant optimization possible"?
I claim we can do O(1) complexity (minus precompute) in all cases, see another comment of mine. Curious if O1 will figure it out.
In that comment, you are generating your own random numbers and then optimizing away the actual generation. It can't take an input array.
While clever, I think that strays too far from the initial prompt.
3 replies →
Given the problem size is bounded, all solutions for solving this could be considered O(1).