algorithms
I graduated with a Computer Science minor from the University of Virginia in 1992. The reason it’s a minor and not a major is because to major in CS at UVa you had to go through the Engineering School, and I was absolutely not cut out for that kind
ergonomics
I've talked about computer workstation ergonomics [https://blog.codinghorror.com/computer-workstation-ergonomics/] before, but one topic I didn't address is lighting. We computer geeks like it dark. Really dark. Ideally, we'd be in a cave. A cave … with an internet connection. [http://tuts.pinehead.tv/
computer science
Have you ever heard a software engineer refer to a problem as "NP-complete"? That's fancy computer science jargon shorthand for "incredibly hard": The most notable characteristic of NP-complete problems is that no fast solution to them is known; that is, the time required to
computer science
Charles Petzold was kind enough to send me a copy of his new book, The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine [http://www.amazon.com/dp/0470229055/?tag=codihorr-20]. [http://www.amazon.com/dp/0470229055/?tag=codihorr-20] One
programming languages
What do you think the single greatest invention in computer science is? Besides the computer itself, I mean. Seriously, before reading any further, pause here for a moment and consider the question. I've talked before about how young so-called modern computer programming languages really are, and it bears
programming languages
I saw on reddit that today, January 10th, is Donald Knuth's seventieth birthday. Knuth is arguably the most famous living computer scientist, author of the seminal Art of Computer Programming series. Here's how serious Mr. Knuth is – his books are dedicated, not to his wife or
programming languages
Leon recently posted a link to a great blog entry on rediscovering Logo. You know, Logo -- the one with the turtle. I remember being exposed to Logo way back in high school. All I recall about Logo is the turtle graphics, and the primitive digital Etch-a-Sketch drawings you could
computer science
While researching Classic Computer Science Puzzles, our CEO Scott Stanfield turned me on to A.K. Dewdney's The New Turing Omnibus: 66 Excursions in Computer Science. This is an incredibly fun little book. Sure, it's got Towers of Hanoi, but it's also got so