Skip to content

Commit 2164c8c

Browse files
committed
modified: Documentation/README.html
modified: README.md
1 parent 5af58ae commit 2164c8c

File tree

2 files changed

+6
-6
lines changed

2 files changed

+6
-6
lines changed

Documentation/README.html

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -221,8 +221,8 @@ <h1 id="calculate--visualize-the-hopalong-attractor-with-python">Calculate &amp;
221221
</ul>
222222
<h2 id="abstract">Abstract</h2>
223223
<h3 id="historical-context">Historical Context</h3>
224-
<p>The &quot;<em>Hopalong</em>&quot;<top>*<top> attractor, authored by Barry Martin of Aston University in Birmingham, England [<a href="#references">2</a>],<br>
225-
was popularized by A.K. Dewdney in the September 1986 issue of <em>Scientific American</em>. In Germany, the Hopalong attractor gained further popularity through an article about an algorithm called 'HÜPFER' published in <em>Spektrum der Wissenschaft</em> [<a href="#references">3</a>].<br>
224+
<p>The <em>Hopalong</em><top>*<top> attractor, authored by Barry Martin of Aston University in Birmingham, England [<a href="#references">2</a>],<br>
225+
was popularized by A.K. Dewdney in the September 1986 issue of <em>Scientific American</em>. In Germany, the <em>Hopalong</em> attractor gained further popularity through an algorithm called <em>HÜPFER</em> in the article <em>Psychotapeten</em> published in <em>Spektrum der Wissenschaft</em>. [<a href="#references">3</a>].<br>
226226
<sub>*Nicknamed by A.K. Dewdney.</sub></p>
227227
<h3 id="the-hopalong-attractor-functions">The Hopalong Attractor Functions</h3>
228228
<p>The mathematical definition of the Hopalong attractor is given by the following system of recursive functions, defined in [<a href="#references">2</a>]:</p>
@@ -803,7 +803,7 @@ <h2 id="references">References</h2>
803803
<strong>Barry Martin</strong>, &quot;Graphic Potential of Recursive Functions,&quot; in <em>Computers in Art, Design and Animation</em> [1],<br>
804804
pp. 109–129.</p>
805805
<p>[3]<br>
806-
<strong>A.K. Dewdney</strong>, <em>Psychotapeten</em>, Algorithm <em>&quot;HÜPFER&quot;</em>, in <em>Spektrum der Wissenschaft: Computer Kurzweil</em>.<br>
806+
<strong>A.K. Dewdney</strong>, <em>Psychotapeten</em>, algorithm <em>HÜPFER</em>, in <em>Spektrum der Wissenschaft: Computer Kurzweil</em>.<br>
807807
Spektrum der Wissenschaft Verlagsgesellschaft mbH &amp; Co., Heidelberg, 1988.<br>
808808
(German version of <em>Scientific American</em>).<br>
809809
ISBN-10: 3922508502, ISBN-13: 978-3922508502.</p>

README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -51,8 +51,8 @@
5151

5252
### Historical Context
5353

54-
The "*Hopalong*"<top>*<top> attractor, authored by Barry Martin of Aston University in Birmingham, England [[2](#references)],
55-
was popularized by A.K. Dewdney in the September 1986 issue of *Scientific American*. In Germany, the Hopalong attractor gained further popularity through an article about an algorithm called 'HÜPFER' published in *Spektrum der Wissenschaft* [[3](#references)].
54+
The *Hopalong*<top>*<top> attractor, authored by Barry Martin of Aston University in Birmingham, England [[2](#references)],
55+
was popularized by A.K. Dewdney in the September 1986 issue of *Scientific American*. In Germany, the *Hopalong* attractor gained further popularity through an algorithm called *HÜPFER* in the article *Psychotapeten* published in *Spektrum der Wissenschaft*. [[3](#references)].
5656
<sub>*Nicknamed by A.K. Dewdney.</sub>
5757

5858
### The Hopalong Attractor Functions
@@ -594,7 +594,7 @@ The full text of the MIT License can be found at:
594594
pp. 109–129.
595595

596596
[3]
597-
**A.K. Dewdney**, *Psychotapeten*, Algorithm *"HÜPFER"*, in *Spektrum der Wissenschaft: Computer Kurzweil*.
597+
**A.K. Dewdney**, *Psychotapeten*, algorithm *HÜPFER*, in *Spektrum der Wissenschaft: Computer Kurzweil*.
598598
Spektrum der Wissenschaft Verlagsgesellschaft mbH & Co., Heidelberg, 1988.
599599
(German version of *Scientific American*).
600600
ISBN-10: 3922508502, ISBN-13: 978-3922508502.

0 commit comments

Comments
 (0)