A Perfect Clock is defined as a Turing machine that can identify cyclical strings from acyclical ones. We argue that such a machine cannot logically exist.