26 Aug
2025
26 Aug
'25
12:03 a.m.
Hey Bill,
How is life in England? Any interesting LUGS?
I was scanning old posts from SacLUG.
Brian
On Sun, Jun 05, 2016 at 07:28:56PM -0700, Bill Kendrick wrote:
I've got speakers lined up for July and August, but no one for June.
Anyone interested in speaking? LUGOD's June meeting is on Monday the 20th.
Thanks!
--
-bill!
Sent from my computer
_______________________________________________
Lug-nuts mailing list
Lug-nuts(a)saclug.org
http://lists.saclug.org/cgi-bin/mailman/listinfo/lug-nuts
--
Brian Lavender
https://www.brie.com/brian/
"There are two ways of constructing a software design. One way is to
make it so simple that there are obviously no deficiencies. And the other
way is to make it so complicated that there are no obvious deficiencies."
Professor C. A. R. Hoare
The 1980 Turing award lecture
26 Aug
26 Aug
12:06 a.m.
New subject: Seeking speaker for June LUGOD meeting!
On Tue, Aug 26, 2025 at 12:03:33AM -0700, Brian E. Lavender wrote:
Hey Bill,
How is life in England? Any interesting LUGS?
I was scanning old posts from SacLUG.
Brian
On Sun, Jun 05, 2016 at 07:28:56PM -0700, Bill Kendrick wrote:
>
> I've got speakers lined up for July and August, but no one for June.
> Anyone interested in speaking? LUGOD's June meeting is on Monday the 20th.
>
> Thanks!
>
> --
> -bill!
> Sent from my computer
Oh, I should bottom post?
Perhaps you can track down Tony Hoare?
https://en.wikipedia.org/wiki/Tony_Hoare
Brian
--
Brian Lavender
https://www.brie.com/brian/
"There are two ways of constructing a software design. One way is to
make it so simple that there are obviously no deficiencies. And the other
way is to make it so complicated that there are no obvious deficiencies."
Professor C. A. R. Hoare
The 1980 Turing award lecture
12:11 a.m.
New subject: Seeking speaker for June LUGOD meeting!
On Tue, Aug 26, 2025 at 12:06:28AM -0700, Brian E. Lavender wrote:
On Tue, Aug 26, 2025 at 12:03:33AM -0700, Brian E.
Lavender wrote:
This for some reason made me think of the pumping lemma proof for
regular languages. I remember sweating over the details of this proof
while taking computing theory.
https://www2.lawrence.edu/fast/GREGGJ/CMSC515/chapt01/Pumping.html
Brian
--
Brian Lavender
https://www.brie.com/brian/
"There are two ways of constructing a software design. One way is to
make it so simple that there are obviously no deficiencies. And the other
way is to make it so complicated that there are no obvious deficiencies."
Professor C. A. R. Hoare
The 1980 Turing award lecture
Hey Bill,
How is life in England? Any interesting LUGS?
I was scanning old posts from SacLUG.
Brian
On Sun, Jun 05, 2016 at 07:28:56PM -0700, Bill Kendrick wrote:
>
> I've got speakers lined up for July and August, but no one for June.
> Anyone interested in speaking? LUGOD's June meeting is on Monday the 20th.
>
> Thanks!
>
> --
> -bill!
> Sent from my computer
Oh, I should bottom post?
Perhaps you can track down Tony Hoare?
https://en.wikipedia.org/wiki/Tony_Hoare 
5:41 p.m.
New subject: Seeking speaker for June LUGOD meeting!
On Tue, Aug 26, 2025 at 12:11:31AM -0700, Brian E. Lavender wrote:
Oof, lisp flashbacks.
-bill!
Perhaps you
can track down Tony Hoare?
https://en.wikipedia.org/wiki/Tony_Hoare
This for some reason made me think of the pumping lemma proof for
regular languages. I remember sweating over the details of this proof
while taking computing theory.
https://www2.lawrence.edu/fast/GREGGJ/CMSC515/chapt01/Pumping.html 
5:46 p.m.
New subject: Seeking speaker for June LUGOD meeting!
… did someone say “Lisp?”
On Tue, Aug 26, 2025 at 17:42 Bill Kendrick <nbs(a)sonic.net> wrote:
On Tue, Aug 26, 2025 at 12:11:31AM -0700, Brian E.
Lavender wrote:
Oof, lisp flashbacks.
-bill!
_______________________________________________
Lug-nuts mailing list -- lug-nuts(a)bigbrie.com
To unsubscribe send an email to lug-nuts-leave(a)bigbrie.com
Perhaps
you can track down Tony Hoare?
https://en.wikipedia.org/wiki/Tony_Hoare
This for some reason made me think of the pumping lemma proof for
regular languages. I remember sweating over the details of this proof
while taking computing theory.
https://www2.lawrence.edu/fast/GREGGJ/CMSC515/chapt01/Pumping.html
5
days inactive
6
days old
4 comments
3 participants
participants (3)
-
Bill Kendrick -
Brian E. Lavender -
Diego R. Martinez