We consider the problem of evaluating a Boolean function on PRAMs. We exhibit a Boolean function f : {0, 1} → {0, 1} that can be evaluated in time O(log log n) on a deterministic CROW (Concurrent Read Owner Write) PRAM, but requires time Ω(log n) on EROW (Exclusive Read Owner Write) PRAMs. Our lower bound also holds for randomized Monte Carlo EROW PRAMs. This Boolean function is derived from th...

The event of Peter’s denials of Christ is a frequent subject of Sunday sermons. The prediction and outplaying of the denials, as recorded in the four Gospels, is a powerful reflection of a condition of our relationship with Christ—that our faith is more vulnerable than we care to admit.1 But a small thorny issue surrounds the Gospel accounts of this event, one that is a nagging distraction to s...