User:Roger Hui/sandbox

Robert A. Smith (born 1 January 1950 in Washington, D.C.) is an American computer programmer best known for his work in APL implementation.

Work

 * time at the NSA, if it can be talked about
 * time at STSC, Inc.
 * Wrote the &ldquo;Nested Arrays: The Tool of the Future&rdquo; chapter in APL in Practice
 * Wrote Boolean Functions
 * Implemented the first NARS
 * time at Qualitas
 * time at Sudley Place Software


 * work with 386MAX
 * work NARS2000
 * Smith was APL Quote Quad Problems Editor in the 1970s.
 * Erdős number, if a smallish number
 * anything else

Anecdotes

 * Smith is the source of the following anecdote about Ken Iverson, the originator of APL:


 * I recall another story about Ken, witnessed firsthand, when he came to the National Security Agency, around 1970, to give a lecture on APL to an audience of several hundred people.


 * He was introduced by someone who gave quite a complete description of Ken’s work and personal history. Then Ken got up to speak. He started by saying that normally when he gives a lecture the host approaches him a few minutes before the start of the lecture and furtively scribbles a few notes about where he went to school, etc. Ken said he was quite surprised that no such discussion occurred this time, until he realized where he was! The audience had a great laugh.


 * Smith presented a paper at the APL79 conference at Rochester, New York. During the question period, Smith was asked, &ldquo;How did you become so good?&rdquo;  His reply: &ldquo;Years of self-denial.&rdquo;
 * Smith is known as &ldquo;Boolean Bob&rdquo; to his colleagues due to his adeptness at the use of APL boolean functions.
 * any other amusing stories

Testing


\begin{align} \begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} F_{n-1} \\ F_n \end{bmatrix} = \begin{bmatrix} F_n \\ F_{n-1} + F_n \end{bmatrix} = \begin{bmatrix} F_n \\ F_{n+1} \end{bmatrix} \end{align}$$



\begin{align} \begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix}^n \begin{bmatrix} 0 \\ 1 \end{bmatrix} = \begin{bmatrix} F_n \\ F_{n+1} \end{bmatrix} \end{align}$$



\begin{align} \begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix}^n = \begin{bmatrix} F_{n-1} & F_n \\ F_n & F_{n+1} \end{bmatrix} \end{align}$$

Testing1


P(n) = \sum_{k=1}^{n} (-1)^{k+1} [P(n-\frac{1}{2}k(3k-1)) + P(n-\frac{1}{2}k(3k+1))] $$