Monday, July 18, 2011

From Chesterton's "Orthodoxy"

But remember that this text is too lightly interpreted. It is constantly assured, especially in our Tolstoyan tendencies, that when the lion lies down with the lamb the lion becomes lamb-like. But that is brutal annexation and imperialism on the part of the lamb. That is simply the lamb absorbing the lion instead of the lion eating the lamb. The real problem is—Can the lion lie down with the lamb and still retain his royal ferocity? THAT is the problem the Church attempted; THAT is the miracle she achieved.

Wednesday, July 13, 2011

Garlic Fries Success!

On my second attempt at making garlic fries, I was successful, modulo a few undercooked fries which can be attributed to a college apartment stove and cheap pan with very uneven heat distribution. Rather than follow the recipe which called for a two-step process of baking the oil-coated fries and then frying them in garlic butter, I went straight to the frying. I also decided to substitute cheddar for parmesan and chives for parsley.


3 cu. inches (approx) sharp white cheddar cheese
4 cloves of garlic
2 chives
4 tablespoons butter 1 large baking potato


Slice potato into 1/4in by 1/4in strips. Melt butter over low-to-medium heat. Begin frying the potato strips in the butter. Increase heat to medium. Crumble cheddar cheese. Finely chop garlic. Chop chives. Combine these ingredients. Turn potato strips as they cook. When strips are golden brown on all sides, add cheese, garlic, and chives, stir with spatula. Place fries on plate covered with paper towel to drain excess butter. Serve immediately.

Tuesday, July 12, 2011

Abstract of Research in Transactional Events

I'll be revising my abstract in this post. Comments appreciated.

Revision 1 (Initial Revision)

Revision 1 (Initial Revision)

Transactional Events is an abstraction (a well-defined concept hiding implementation details) for communication between concurrent processes (multiple programs running at once). The current implementation of Transactional Events provides only the guarantee that a communication will happen if one is possible.

A particularly attractive possible guarantee is that of "fairness," which guarantees that for a concurrent thread which is repeatedly capable of communicating, there is no point after which it never communicates.

In each of our attempts to enforce this property in the implementation, we have been able to construct counterexamples which either prevent the system from making progress or escape the enforcement of the fairness guarantee. This leads us to suspect that enforcing fairness requires the solution of an undecidable problem.

To prove that enforcing fairness requires this solution we are attempting to demonstrate that an implementation which enforces fairness would permit the solution of such an undecidable problem. Such a demonstration would prove the impossibility of enforcing the fairness condition.

Finally, we are exploring if a condition similar to fairness but weak enough to enforce would still be useful.