Because hackers have a social life too...
root@0-day~# nmap 38.107.179.244 -sV -O -p0-65535 -sT -sU -T4
Description:
The Sleeping Barber problem is a classic inter-process communication and synchronization problem between multiple operating system processes, first described by Edsger Dijkstra, one of the pioneers of computation.
Suitable for:
Computer science students/grads, programmers, mathematicians and geeks.
Technical Specifications:
Durable flex print; one color.