diff --git a/2001/herrmann1/herrmann1.c b/2001/herrmann1/herrmann1.c
index 4466a2881..9afde94c5 100644
--- a/2001/herrmann1/herrmann1.c
+++ b/2001/herrmann1/herrmann1.c
@@ -51,7 +51,7 @@ q D H y ## z
 d c 0    & 0
 d R i    W v
 d   B           Initializing...
-d   L    V   /* the turing    */
+d   L    V   /* the Turing    */
 d   M    Y(O)/* state to      */
 d S(x)   T(O,1, start       ##x)
 #else
diff --git a/2001/herrmann1/herrmann1.gcd b/2001/herrmann1/herrmann1.gcd
index 7645604a3..0e42be4ec 100644
--- a/2001/herrmann1/herrmann1.gcd
+++ b/2001/herrmann1/herrmann1.gcd
@@ -35,7 +35,7 @@
 #define st13_I  I, right, st13
 #define st14_O  O, left , st_next_iteration
 #define st14_I  O, right, st14
-/* The state "st_next_iteration" means the turing machine
+/* The state "st_next_iteration" means the Turing machine
    is about to do the next iteration of the Euklid algorithm.
    (That is, during that state, there are two numbers on the
    tape with the same gcd as the initial numbers.) */
diff --git a/2015/endoh1/prog.c b/2015/endoh1/prog.c
index 7255af233..b5fa16a3b 100644
--- a/2015/endoh1/prog.c
+++ b/2015/endoh1/prog.c
@@ -15,7 +15,7 @@ u[1]=y/2    ;w.send(d.slice(0,x<0?0:             2));x=y=-\
 ,lu,lv,    z;void*f;typedef unsigned              long long
 l;l*p,t[  99]={0x67452301,0xEFCDAB89,            0x98BADCFE
 ,308438*  881,3285377520       },i,j,k           ,n,m[204];
-#include        /*io*/          <stdio.h>        /*turing*/
+#include        /*io*/          <stdio.h>        /*Turing*/
 void s(){  ;     for(  k          =0;k++<7 *  2  *9;)for(i=
 0;++i<127; )      e=d +  i* 4   +512*k,1[e]      +=(i-u)*(i
 -u)+(k-v)* (k- v  )<20?*e+=UV_DROP:0;}l*q=  m,   g=1LL<<32;
diff --git a/all/summary.txt b/all/summary.txt
index fba2d1860..19697f67d 100644
--- a/all/summary.txt
+++ b/all/summary.txt
@@ -44,7 +44,7 @@
 1989 jar.1	char*_="Hello world.\n";
 1989 jar.2	lisp interpreter, compressed
 1989 ovdluhe	monkey-typer following template, 'APE' identifiers
-1989 paul	print fibonacci base 2 by simulating turing machine
+1989 paul	print Fibonacci base 2 by simulating Turing machine
 1989 robison	apl-expression interpreter (binary), written in C--
 1989 roemer	prints e, script-pi shaped layout, _31415 identifiers
 1989 tromp	squished tetris
diff --git a/years.html b/years.html
index 05eae0038..02d442e6f 100644
--- a/years.html
+++ b/years.html
@@ -3315,7 +3315,7 @@ a window manager that does not obscure the root window.
 <LI><A HREF="1989/ovdluhe/ovdluhe.hint">ovdluhe.hint</A>
 </UL>
 <A NAME="1989_paul"></A>
-<P><B>paul</B> - print fibonacci base 2 by simulating turing machine</P>
+<P><B>paul</B> - print Fibonacci base 2 by simulating Turing machine</P>
 
 <UL TYPE=square>
 <LI><A HREF="1989/paul/Makefile">Makefile</A>