In this talk, I will present a recent result I learned from Joel Spencer: Whereas classical random graphs (at least G(n,p), p constant) obeye Zero-One-Laws, random geometric graphs do not. This is not my own work, so no `open problems' or `further work'. Still I think it is an important result that is good to keep in mind.