More fixes in 2005/README.md + update todo.md

The todo.md change is related; see below.

This commit was needed because in commit
68a9d0adb5 I moved (the 'yank paste get
distracted and forget error' :-) ) comments on some of the losing
entries to below the comments on the winning entries (since that's what
most people are interested in after all) to the bottom but then forgot
(I have been awake since 0000 hours or a bit before!) to go through them
all.

Added links.

Possible spelling fixes.

I hope this finishes 2005. Note that the root README.md files for all
other years have NOT been fixed yet. I will do these in future, maybe
today or maybe not. I'm kind of focused on getting the entries done
first but I might do the next years like I did this year. This is TBD
but I've added it to the todo.md file.

2005/README.md

@@ -31,53 +31,56 @@ We believe you will be impressed with this year's winners.
 
 In particular:
 
-+ The Abuse of the rules used local dictionary data to get around the
-size limit.
++ The [Abuse of the rules](klausler/klausler.c) used local dictionary data to
+get around the size limit.
 
-+ The Most beauteous visuals made clever use of {}'s and whitespace in their source code and during execution.
++ The [Most beauteous visuals](vince/vince.c) made clever use of `{}`s and
+whitespace in their source code and during execution.
 
-+ The most circuitous walk entry is just amazing.
++ The [Most circuitous walk](vik/vik.c) entry is just amazing.
 
-+ The Best game makes full use of its single function.
++ The [Best game](toledo/toledo.c) makes full use of its single function.
 
-+ The Best emulator may allow you to re-connect to your first PET.
++ The [Best emulator](sykes) may allow you to reconnect to your first
+[PET](https://en.wikipedia.org/wiki/Commodore_PET).
 
-+ Our Best of Show this year was simply (or non-simply) the best!
++ Our [Best of Show](persano/persano.c) this year was simply (or non-simply :-) ) the best!
 
-+ (And we need only mention (parenthetically speaking) that the best use of parenthesis is self re-producing).
++ (And we need only mention (parenthetically speaking) that the best use of parenthesis is self reproducing).
 
-+ The most sonorous output might sound like a good idea.
++ The [Most sonorous output](jetro/jetro.c) might `sound` :-) like a good idea.
 
-+ The Best 2D puzzle takes editorial license with expressions as well as the
-with the vi editor.
++ The [Best 2D puzzle](giljade/giljade.c) takes editorial license with expressions as well as the
+with the [vi editor](https://en.wikipedia.org/wiki/Vi).
 
-+ The Most ambiguous language winner is really a C program.
++ The [Most ambiguous language](chia/chia.c) winner is really a C program.
 
-+ The superfluous output winner is simply Voronoilific!
++ The [Most superfluous output](boutines/boutines.c) winner is simply
+[Voronoi](Voronoi)-lific!
 
-+ Try not to have your sense of good coding offended by the Most
-discourteous interpreter winner.
++ Try not to have your sense of good coding offended by the [Most
+discourteous interpreter](timwi/timwi.c) winner.
 
-+ The Best use of the www doesn't include those letters
++ The [Best use of the www](mynx/mynx.c) doesn't include those letters.
 
-+ You will be puzzled by Best 3D puzzle winner, we are sure!
++ You will be puzzled by the [Best 3D puzzle](anon/anon.c) winner; we are sure!
 
-+ The Most ingenious puzzle solution might puzzle you more while it
++ The [Most ingenious puzzle solution](aidan/aidan.c) might puzzle you more while it
 puzzles out some puzzles: all in a puzzling way!  :-)
 
-### Remarks on some losing entries
+### Remarks on some of the losing entries
 
 There were some outstanding entries that did not win.  Unfortunately
 some very good entries lost because they:
 
-+ depended too much on non-portable side effects in expressions;
++ depended too much on non-portable side effects in expressions; and/or
 
-+ depended too much on a particular byte order;
++ depended too much on a particular byte order; and/or
 
 + required the use of a special script, data file or pseudo-machine
   language that was not supplied with the entry.
 
-We hope the authors of some of those entries will fix and re-submit
+We hope the authors of some of those entries will fix and resubmit
 them for the next IOCCC.
 
 
@@ -99,7 +102,8 @@ requests](https://github.com/ioccc-src/temp-test-ioccc/pulls) in the entry's
 `README.md`.
 
 
-For the latest information on how to contact the IOCCC Judges please visit
+For the latest information on how to contact the [IOCCC
+Judges](https://www.ioccc.org/judges.html) please visit
 <https://www.ioccc.org/contact.html>.
 
 For news of the next contest watch <https://www.ioccc.org/>.

todo.md

@@ -1,5 +1,5 @@
 # A todo list of known things to check and/or do
-*Last updated: Sun  9 Apr 2023 13:38:05 UTC*
+*Last updated: Sun 30 Apr 2023 11:05:45 UTC*
 
 More things will likely be added over time and as items are done they _should
 be_ removed from the list IF AND ONLY IF (!!) we are certain it is done (many
@@ -17,6 +17,11 @@ INABIAF ones. This is likely not possible but some certainly can be fixed.
 
 - Check for typos in README.md files.
 
+- Go through all year README.md files that is 1984/README.md, 1985/README.md and
+so on. Only 2005/README.md has been done (though 2004/README.md is about to be
+done so one might say that as of 30 April 2023 only 2004 and 2005 have been
+fixed).
+
 - Verify which README.md files have not been checked for correct formatting and
 fix any issues.
     * This includes author information: not only at first column but making sure