Posted: Tue Oct 21, 2014 5:30 pm
Maybe we should all cooperate and find the absolutely smallest mouse
Fortunately, human creativity and intelligence still often enough beats computing power:Hippo wrote:Hmmm, I have a feeling the snibril constraint solution does not exist .
I have decided to run bruteforce search for it ... looks like several years of machine time would suffice to prove the nonexistence of it ... . (I am not searching for 20 op code, but 21 without > ...)
Hmmm, the estimate time is something between 10^8 to 10^12 years ... the prunnig is probably not powerful enough . ... maybe using idle time of all world computers ... but the energy consumption ...
... hvm simulator using graphic cards paralelism ... if something like that would be possible, than maybe ...
Code: Select all
Er... you did not see that.
Code: Select all
10^<11^0<1^7?::>1+1cp
I am happy I was able to help . ... May be we should remove the hints?a.goth wrote:Oh boy! I did not see the forest for the trees. Stupid me.