Back in first year we were given a bonus puzzle: to find a program for an imaginary MCU called a '4917 Chip' that is contains no infinite loops and prints out the longest string of characters possible.
At the time we did not know about the Halting Problem: look it up on Wikipedia if you do not see what the issue is with this kind of problem.
However, some of us realised that we could brute force optimal solutions for small problems but it quickly became impossible once the program became larger. Thus this implementation is a tribute to that. You can find the code for this project on Github under my 'robertmassaioli' account.
12 дек 2011
