Поэзия
Algorhyme
I think that I shall never see
a graph more lovely than a tree.
A tree whose crucial property
is loop-free connectivity.
A tree that must be sure to span
so packet can reach every LAN.
First, the root must be selected.
By ID, it is elected.
Least-cost paths from root are traced.
In the tree, these paths are placed.
A mesh is made by folks like me,
then bridges find a spanning tree.
Radia Perlman
R. Perlman, кстати, является автором Spanning Tree Protocol и вообще её называют «Mother of the Internet».
Ну и не менее прекрасное:
Derived Functor Rap
This is a new rap on the oldest of stories -
Functors on abelian categories.
If the functor is left exact
You can derive it and that's a fact.
But first you must have enough injective
Objects in the category to stay active.
If that's the case - no time to lose;
Resolve injectively any way you choose.
Apply the functor and don't be sore -
The sequence ain't exact no more.
Here comes the part that is the most fun, Sir,
Take homology to get the answer.
On resolution it don't depend:
All are chain homotopy equivalent.
Hey, Mama, when your algebra shows a gap
Go over this Derived Functor Rap.
Paul Bressler