Would you see anything interesting if you were to do signal analysis on the prime numbers ( Read more... )

I'm currently enjoying The Little Schemer as a way to attempt to learn more of the Lisp/Scheme programming paradigm. It's been a useful book for me so far, in that I'm 30 pages in and haven't yet had to stop and go, "Wait, WTF?!"*

( Cut for rambling )

It's kind of spooky that this actually makes sense to me:

A deterministic finite automaton is a structure

M = (Q, E, d, s, F) where

• Q is a finite set, the states
• E is a finite set, the input alphabet
• d : Q X E -> Q is the transition function that maps each of the possible combinations of (state, input) pairs to a state.
• s is a member of Q and ( Read more... )

If I'm remembering correctly, one of the generally accepted concepts in mathematics is that two lines in a plane will never intersect if and only if they are parallel. They go on forever without crossing. However, if they are out of parallel by the tiniest amount then at some point they must cross.

What point is that?

I had a thought a few seconds ago that I wanted to put in here, but I wanted to make sure that I was accurate about it. ( Then I realized that I didn't really know how to express it )