I write, therefore I am
With this variation on a famous statement by the philosopher Descartes, I would like to express that the act of writing about what happens in my life is important to me.
I Am a Strange LoopThis morning, I finished reading the Dutch translation ("Ik ben een vreemde lus") of I Am a Strange Loop by Douglas Hofstadter, which I started reading on March 5, after I bought it on Tuesday, July 23, 2013. I did not really read the last chapters of the book, just skipped through the pages to see if they might still contain some original thought. This book is full of repetitions. Hofstadter just keeps on saying the same thing in different ways. Often tries to explain things without not mentioning. As if you can explain the most fundamental theorems in computer science and mathematics, without having a basic grasp of these areas. He wrote this book because he was disappointed that people did not grasp the meaning of his Gödel, Escher, Bach: An Eternal Golden Braid, which did include all the mathematics and computer science, and probably thought that people would grasp it if he would not mention those. A flawed idea, I think. I also feel that with this book he just circles around the main question, (what is the origin of subjective consciousness, the experience of the I?) without really touching the matter or making it relevant. I had always assumed that with the statement, I am a strange loop, he meant that in our brain we construct a model of the world around this, and this model includes a model of ourselves, which incluses our brain, causing a kind of end-less recursion. But it seems he simply means that we construct an idea of ourself based on all our previous experiences. Yes, that explains the 'I', but not the experience of subjective consciousness. I cannot conclude that I find this the most unsatisfactory read of the past years, because I feel that this book is just flawed in one too many ways.
BookAt 10:53, I bought the book Foto Biennale Enschede 1993 from the charity shop Het Goed for €1.75. On pages 74 and 75 there are picture from Irmgard Lamers with the title 'Het Huwelijk' ('The Marriage').
PARR: Maximal connections (part 2)I continued working on the question that given a number of points, what it the maximum of straight (horizontal or vertical) or diagonal connection between immediate neighbours when these points are placed on a square grid. This came up last week during my investigation into PARR configurations. PARR configurations are limited to a four by five grid, but here I investigate the problem when there are no limits. After some experimenting, it appeared that point configurations that resemble a 'round' octagon have the highest number of connections, which is not very surprising. I wrote a program to calculate the maximal number of connections for given points, which produced results for the number of points up to 1000. Each line start with the number of points, followed with the maximal number of connections, with, between brackets, the increment compared to the previous value. The rest of the line contains descriptions of the configurations, where, for example, 6x5-1,1,1,2-1 stands points placed inside a retangle of six by five points, where points from the corners have been removed, three of the corners have one point removed and the other had three points (equal one plus two) removed. Finally, one more point is removed at edge of a corner and one of the sides. Resulting in the following layout:
*-*-* /|X|X|\ *-*-*-*-*-* |X|X|X|X|X| *-*-*-*-*-* |X|X|X|X|/ *-*-*-*-* \|X|X|/ *-*-*
ChestnutsYesterday evening, I picked four chestnuts from before the Chinese restaurant at the Haaksbergerstraat. This afternoon, I picked five chestnuts from at Wilminkweg where I also picked one exactly two years ago. This week, I also brought some chestnuts home that I had kept on the monitor stand in my office for the past years.
PARR: maximal connectionsWhen I was working on the PARR configurations, I noticed that there were two unique configurations on five points with eight connections. Because I could only imagine one such configuration, I first thought that there must have been a bug in the program, but when I looked at the print of the configurations, I found that five points in the shape of a cross also have eight connections. Then, I began to look at the other configurations with a maximal number of connections. I expected that there would be a simple pattern in those, but that appeared not to be the case. I found the following sequences of maximal number of connections for the number of points starting with one: 1, 3, 6, 8, 11, 14, 17, 20, 23, 26, 30, 33, 36, 39, 43. I did check for this sequence in the The On-Line Encyclopedia of Integer Sequences®, but did not find it. I made a drawing of all the maximal configurations on four to sixteen points, in which red lines connect configurations of different sizes that can be embedded without translation and a blue line for two configurations that require mirroring:
Remark: The second configuration on the second last row does not fit in a 4 by 5 PARR configuration
Unique PARR configurationsI completed the algorithm for finding unique PARR configurations. The algorithm makes use of the transition table that is generated by the slicing method. It took me some time to get all the rotations and mirrorings correct. The algorithm simply generates all the configurations (up to a certain number of points) and then rotates, mirrors the configuration in all directions seeing if it would result in a 'smaller' configuration. If it does not, it is counted, and also written to a binary file for later processing. With smaller, I mean that a binary vector is made out of all the points and connections and if this vector is smaller than the configuration in it original orientation. It appreared that for the restriction that all pairs of neighbour points should have connection, either with or without crossing diagonals, it is possible to calculate all unique configurations within reasonable time. For the configurations where not all neighbour points are connected, this is not feasable, simply because the number connected configurations is more than a million times larger. Only all unique configurations on nine or less points where counted and written to file. The calculation for those configurations took almost six hours on johan. I guess that for ten or less points the time will more than fourty hours. The current version of the program finds the results shown in the table below. The numbers between brackets are for all configurations with nine or less points.
The image shown with the 'PARR' bar on WLFR shows the PARR 7|11 Reference Guide about PARR configurations with seven points and eleven connections. The calculation show that there are a total of 802 connected PARR 7|11 configurations. The program PARRan_7_11.cpp when given the PARR_con_o_9.data file as input produces the list of all solution (as ASCII art): PARR_7_11.txt.
I just noticed that the image also shows a disconnected PARR on the left page of the book that is layed open at the bottom half. Both PARR configuration shown in that book have five points and four connections. I guess this is the PARR 5|4 Reference Guide. Maybe I should also calculate the number of unique configurations on disconnected PARR configurations.
BookAt 10:15, I bought the book POPism: The Andy Warhol '60s by Andy Warhol and Pat Hackett, from the charity shop Het Goed for € 1.50.
BlaoThis evening, Carina Schüring visited us. She brought the painting, which she recently named 'Blao', with her. It is the painting that I had decided to buy after we visited her on Wednesday, July 15. After we had dinner, I read through the purchase contract, stated in German, as she is a German citizen, signed it, and transfered a sum of money to her account, thus making me the owner of the work. The contract contained a clause, giving her the right to put the work on display, whenever she has an exhibition, for which it is suitable. I am very happy to borrow it to her for that purpose.
PARR: correctionsWhile working on the counting algorithm for unique PARR configurations, I discovered an error in the previously published results. The current version of the program finds the results shown below in the table. The bold number is the number of connected configuration in which not all neighbour points have a connection and in which crossing diagonals are allowed.
You should be here!I finished reading the book You should be here! A book about Helsinki by Tom Bulgaria, which I started reading on August 30 after I bought if on August 21. I enjoyed reading this alternative tourist guide to Helsinki. It made me want to stay there for some months and visit all the places mentioned in the book. I stayed in Helsinki in May 1996. a rainbow, I found a partial (around 19:19). It quickly grew into an almost complete, rather faint single rainbow. I waited for the sun to appear behind the cloud, hoping it would result in a bright rainbow against al already rather dark background, but that never happened. When around 19:23, I arrive at the end of the Lonnekerbrugstraat my view was obstructed by some trees, and when I could see the sky again, the rainbow was gone, and so where the rays because the sun had disappeared behing some thick clouds. Later, I realized that this rainbow was not caused by direct sunlight, which made it noteworthy.
Consciousness and the BrainThis morning, I finished reading Consciousness and the Brain by Stanislas Dehaene, which I started reading on August 15. Two months before, I bought it in Antwerp. The book is based on scientific research in the past thirty years, which is reflected in list of references covering 32 pages. Yet, the book is very readable and I enjoyed reading it. There were only a few sections where I felt that the author was kind of repeating the same statement in a different manner, probably with the aim to clarify his central ideas. The book indeed exposes some very interesting discoveries with respect to consciousness, but I doubt if those (now or in the future) address the mystery with of subjective experience. I also think that his ideas about how consciousness could (in the future) be achieve with computers, rather simplistic, probably due to a lack of understandig of how computers work.
Chapter 6 deals with the disorder of consciousness that can follow coma, such as the vegetative and minimally conscious states. I wonder how these match with de disorder of consciousness that occur in the late stages of dementia. Is it true that people progress from the minimally conscious state to the vegetative state before going into coma. I wonder if any research has been done in this area, now that relatively simple techniques for detecting conscious states have been discovered.
2 by 2 unique PARR configurationsI found a newspaper article Tussen kunst en wetenschap: Taco Stolk en de schoonheid van wiskunde on page 15 of the Leidsch Dagblad of December 5, 2001. The text is not completely visible, but I guess that PARR stands for Particle Aesthetics Relation Research. With the article there is also a picture of Taco Stolk sitting in front of laptop showing (with white on a black background) a PARR configuration on seven points and nine connections with two crossing diagonal connections. I conclude from this, that crossing diagonals are allowed in PARR configurations.
Below, a drawing of all unique PARR configurations on a two by two grid, not taking into account rotating and mirroring. I have placed them in rows and columns depending on the number of horizontal and vertical connections (rows) and the number of diagonal connections (columns). There are 31 of them:
Trip to China 2010
-- contact -- Frans
My life as a hacker
The Art of Programming
HTML to LaTeX
eXtreme Programming Hamilton cycles