The idea to find the “maximal number that can be named” can be traced back to Archimedes (see his Psammit [1]). From the viewpoint of computation theory the natural question is “which number can be described by at most n bits”? This question led to the definition of the so-called “busy beaver” numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like n...

This work extends the watermarking method proposed by Kutter et al. [1] to increase the watermark decoding performance for textured or busy images. The proposed algorithm modifies watermark embedding rule to utilize image characteristics, like local standard deviation and gradient magnitude, in order to increase the decoding accuracy for busy images. The method does not need original image for ...

Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or even compute special values of Σ. Σ(5) is not yet known. A new approach to the computation of Σ(5) is presented, together with preliminary results, especially Σ(5)≥4098. This approach includes techniques to reduce the number of inspected Turing machines, to accelerate si...

This research tests the hypothesis that being busy increases motivation and reduces the time it takes to complete tasks for which people miss a deadline. This effect occurs because busy people tend to perceive that they are using their time effectively, which mitigates the sense of failure people have when they miss a task deadline. Studies 1 and 2 show that when people are busy, they are more ...