When considering a class of Turing machines that halt when started from a blank tape, busy beavers for that class, as coined by Tibor Radó, are those Turing machines which eventually halt after the maximum number of steps (or after producing the maximum number of non-blank symbols). Finding for a class of Turing machines the busy beaver champion (for any of the two competitions) is of course un...

This work examines how awareness systems, a class of technologies that support sustained and effortless communication between individuals and groups, can support family communication. Going beyond the evaluation of specific design concepts, this paper reports on three studies that aimed to answer the following research questions: (a) Do families want to be aware of each other through the day? O...

We consider the busy period in the GI/M/1 queue with multiple exponential vacations. We derive the transform of the joint distribution of the length of a busy period, the number of customers served during the busy period, and the residual interarrival time at the instant the busy period ends.