BOINC Central: Difference between revisions

Line 23:

One example Knuth chose is the segments of a digital display, as we know it from (somewhat dated) alarm clocks or quartz watches. The inputs are the four bits of a number 0 to 15 (we want hexadecimal digits) and the seven output functions are whether each of the segments of the display should be turned on or off for that digit.

[[File:16-digits-segments-small.png|frameless]]

My goal is to find the minimal boolean chain for this problem, hoping to come up with some new algorithms or speed improvements to make this feasible; so that similar problems can be solved in the future. I've already found shorter boolean chains with an algorithm described on the website below, but to prove it is optimal I need to do an exhaustive search. I also suspect that there still are chains that are ONE step shorter than the one I found, based on the trajectory of smaller problems already solved, but for that I also need the exhaustive search.

Details of the project: https://orunge.org/boolean-chains/

I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly. That's where I hope BOINC Central can help!

I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly.

That's where I hope BOINC Central can help!

Results can be tracked here: https://orunge.org/boolean-chains/#results-full

== Project team / Sponsors ==

[[wikipedia:David_P._Anderson|'''''David P. Anderson''''']]. Operated by [https://boinc.berkeley.edu/ '''''B'''erkeley '''O'''pen '''I'''nfrastructure for '''N'''etwork '''C'''omputing'']

@@ Line 23: / Line 23: @@
 One example Knuth chose is the segments of a digital display, as we know it from (somewhat dated) alarm clocks or quartz watches. The inputs are the four bits of a number 0 to 15 (we want hexadecimal digits) and the seven output functions are whether each of the segments of the display should be turned on or off for that digit.
 [[File:16-digits-segments-small.png|frameless]]
 My goal is to find the minimal boolean chain for this problem, hoping to come up with some new algorithms or speed improvements to make this feasible; so that similar problems can be solved in the future. I've already found shorter boolean chains with an algorithm described on the website below, but to prove it is optimal I need to do an exhaustive search. I also suspect that there still are chains that are ONE step shorter than the one I found, based on the trajectory of smaller problems already solved, but for that I also need the exhaustive search.
 Details of the project: https://orunge.org/boolean-chains/
-I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly. That's where I hope BOINC Central can help!
+I've already covered a large search space with my own machine and AWS Batch, but that approach will be too costly.
+That's where I hope BOINC Central can help!
 Results can be tracked here: https://orunge.org/boolean-chains/#results-full
 == Project team / Sponsors ==
 [[wikipedia:David_P._Anderson|'''''David P. Anderson''''']]. Operated by [https://boinc.berkeley.edu/ '''''B'''erkeley '''O'''pen '''I'''nfrastructure for '''N'''etwork '''C'''omputing'']