Programmers think dynamic languages like Python are easier to use than static ones, but why? I look at uniquely dynamic programming idioms and their static alternatives, identifying a few broad trends that impact language usability.
Preface Hi folks! For quite some time there was no article from my side. Life kept me busy with all sorts of things, but here is a little something until some cooler project emerges :slight_smile: . This article will …
One of the keywords newcomers hear when learning about blockchain are the notions of a hash and a hashing algorithm which seem to be ubiquitous for security. Running a decentralized network and…
Humans are tribal animals, and a recurring failure to grasp this truth has contributed to some of the worst debacles of U.S. foreign policy in the past 50 years.
In this article, we’re going to introduce self-organizing maps. We assume the reader has prior experience with neural networks. Self-organizing maps are a class of unsupervised learning neural…
In an earlier post I mentioned that one goal of the new introductory curriculum at Carnegie Mellon is to teach parallelism as the general case of computing, rather than an esoteric, specialized subject for advanced students. Many people are incredulous when I tell them this, because it immediately conjures in their mind the myriad complexities…
In this tutorial I’ll explain how to build a simple working Recurrent Neural Network in TensorFlow. This is the first in a series of seven parts where various aspects and techniques of building…
John D. Cook, Greg Egan, Dan Piponi and I had a fun mathematical adventure on Twitter. It started when John Cook wrote a program to compute the probability distribution of distances $latex |xy - yx|$ where $latex x$ and $latex y$ were two randomly chosen unit quaternions: • John D. Cook, How far is xy…
There’s plenty of buzz around the web 3.0 and the sweeping changes it will bring to the industry, but few people actually know why it spawned and what it will bring. To understand this, it’s…
While simple approximations to the bbox are trivial (such as computing the bounding box of their control points), in this article we deduce the exact bounding box analytically.
Ben Nadel discusses database index design, including Primary and Secondary indexes, surrogate and natural keys, uniqueness constraints, foreign keys, covering indexes, and even cow-path paving. His hope here is write the article on database index design that he wishes he had had access to way earlier in his web development career.