A clueless beaver discovers the impact his actions have on others.

Five busy beavers building up a dam, closing up the river where the salmon swam. Gnawing down trees and ferrying the logs. Slapping on the mud that they gathered from the bog. Along came a muskrat who wanted to play, and one little beaver swam away. Five little beavers are hard at work on their dam until, one by one, their forest friends pull them away to play. After visits from a muskrat, a heron, a frog, and a turtle, there’s just one hardworking beaver left at the end of the day. But when the fifth tired beaver leaves her sticks and mud behind and heads back to the lodge, a big surprise awaits! With catchy, playful rhyme, irresistibly cute illustrations, and a supplementary page of facts about all the species featured, Five Busy Beavers makes counting and learning fun!

Photographs and text introduce the physical characteristics and habits of the beaver.

Simple text follows the activities of a beaver family as they swim, play, and build a sturdy dam.

While the other beavers in his family furiously flip-flap their tails and chomp-chomp their teeth to make a new dam, young Thelonious takes a moment to smell the flowers, causing the other beavers to stop and join him.

A family of beavers lived inside a little island with a secret tunnel in the middle of a lake. The family was happy sleeping to the lapping sound of the water on to the island but one day something was not right and there was no lapping...

Thomas M. Cover and B. Gopinatb The papers in this volume are the contributions to a special workshop on problems in communication and computation conducted in the summers of 1984 and 1985 in Morristown, New Jersey, and the summer of 1986 in Palo Alto. California. The structure of this workshop was unique: no recent results. no surveys. Instead. we asked for outstanding open prob~ lems in the field. There are many famous open problems, including the question P = NP?, the simplex conjecture in communication theory, the capacity region of the broadcast channel. and the two·helper problem in information theory. Beyond these well-defined problems are certain grand research goals. What is the general theory of information flow in stochastic networks? What is a comprehensive theory of computational complexity? What about a unification of algorithmic complexity and computational complex ity? Is there a notion of energy-free computation? And if so, where do information theory, communication theory, computer science, and physics meet at the atomic level? Is there a duality between computation and communication? Finally. what is the ultimate impact of algorithmic com plexity on probability theory? And what is its relationship to information theory? The idea was to present problems on the first day. try to solve them on the second day, and present the solutions on the third day. In actual fact, only one problem was solved during the meeting -- El Gamal's prob· lem on noisy communication over a common line.