Prime numbers!

Here is a simple scheme program to generate prime numbers in scheme.
;Written by Fakrudeen Ali Ahmed
;Date 9 January 2007
;primes above a bound
(define (primes-above n count)
(define (loop k count)
(if (= count 0) '()
(if (prime? k) (begin (display k) (newline) (loop (+ k 1) (- count 1))) (loop (+ k 1) count))))
(loop n count)
)

;primes less than n
(define (primes-less-than n)
(define (loop k)
(if (= k n) '()
(begin (if (prime? k) (begin (display k) (newline))) (loop (+ k 1)))))
(loop 2)
)

;whether n is prime?
(define (prime? n)
(cond
((or (= n 2) (= n 3)) true)
((or(= 0 (remainder n 2)) (= 0 (remainder n 3))) false)
(else (let ((limit (expt n (/ 1 2))))
(define (loop k)
(let* ( (j (- (* 6 k) 1) ) (l (+ j 2)) )
(cond
((< limit j) true)
((or(= 0 (remainder n j)) (= 0 (remainder n l))) false)
(else (loop (+ 1 k))))))
(loop 1)))))

Godel's theorem!

Godel proved there are true statements, whichever are unprovable!!
Isn't interesting?
That forever dashes the hope we can prove all mathematical facts.
http://en.wikipedia.org/wiki/Kurt_G%C3%B6del
It also has interesting consequences for what we can calculate algorithmically.

IBM developerworks!

If you are developer this site is a "must" see.
developerWorks : IBM's resource for developers [ http://www.ibm.com/developerworks/ ]

They also have a weekly newsletter.

Wikipedia!

I love these folks!
http://wikipedia.org
This is the the first place I search to know about something!

style preview in word

New Microsoft word has a nice live preview of style. Select a block of text and just move the cursor over style boxes on top and see!

Perumazhakkalam (പെരുമഴക്കാലം)

If you like watching good movies in Malayalam, Perumazhakkalam (പെരുമഴക്കാലം) is surely one. Different story. Watch it yourself!

Blank slate!

A very good book about biology/human nature.
It argues that root of most of our behaviours are due to our genes.
Makes you realistic [as opposed to optimist or romantic]!

prefix vs postfix -- operator

I realized if I have a choice I should use prefix -- instead of postfix.

int findLength(const Node* list) {
int count = 0;
for(const Node* current = list; count++ < current =" current-">getNext()) {
}
return count--; //<-------------- bug
}
This is a bug [which compiler doesn't warn either] - what is the point of incrementing a local variable after it is returned!?

--count here works fine and is correct.

C runtime source!

C runtime source is available with visual studio installation. It is very useful say for checking how malloc is implemented.
It also has nice and tested algos. for strncpy etc.

Clippool

It is a cool utility to copy from one computer and paste in another computer: http://support.microsoft.com/kb/318760

Google earth!

I love it - particularly look at its driving directions!
I just don't want to close this!
[Make sure you have hardware acceleration set to full for display to avoid directx problems]

string comparisons in .NET

This article is very good for understanding ordinal vs invarint vs current cultures in .NET

http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dndotnet/html/StringsinNET20.asp

Startup programs

Here is an interesting link I found about [disabling!] startup programs:
http://www.pacs-portal.co.uk/startup_index.htm

edge

If you like to reflect [in the metaphysical sense] a bit, this is a nice site to do that:
http://www.edge.org/

Particularly have a look at world question center. It has answers for a "big" question from eminent people at the start of every year.

Thinking in Java!

One of the best books for learning Java is this: Thinking in Java.
What's more, its free from Bruce eckel's site.
http://www.mindview.net/Books/TIJ/