or subscribe with
Join 15,000+ readers for one email each week.
Digests » 367
Looking to upgrade your programming skills? Here’s something that will really help—Manning Publications are offering an exclusive 40% off your entire order at manning.com! Just use the code nlprogramming when you checkout.
this week's favorite
Forms are arguably the most important parts of any web application. Without forms, we would not have sites like Google, Facebook, Amazon, Reddit, etc. However, the more I browse the web, the more I see poor implementations of forms.
Boolean satisfiability problem (SAT) is the problem of deciding whether a formula in boolean logic is satisfiable. A formula is satisfiable when at least one interpretation (an assignment of true and false values to logical variables) leads to the formula evaluating to true. If no such interpretation exists, the formula is unsatisfiable.
It was May 11, 2000, and if de Guzman was feeling shell-shocked, he had good reason to be. He was accused of authoring and releasing the first truly global computer virus that had disrupted the operations of businesses and government agencies the world over, from Ford (F) and Merrill Lynch to the Pentagon and the British Parliament, and was on track to cause a estimated $10 billion in damages — all in the name of love.
How much thought have you put into your primary input device? Ever considered how much better your interface with your computer might be? In this article, we dive into the possibilities of mechanical keyboards. The different layouts, switch types and even keycap material. Strap yourself in — this will be a deep dive!
The twelve-factor methodology can be applied to apps written in any programming language, and which use any combination of backing services (database, queue, memory cache, etc).