I know it’s too much too hope that I have any regular readers, but if you come here even infrequently you may have noticed it’s been seven months since I last posted. You may even have wondered what I have been up to. What could’ve possible kept Tony so busy that he would totally ignore …
Category: Programming
Nov 21 2017
Proof of Kleene’s Theorem
In my last post, “Kleene’s Theorem,” I provided some useful background information about strings, regular languages, regular expressions, and finite automata before introducing the eponymously named theorem that has become one of the cornerstones of artificial intelligence and more specifically, natural language processing (NLP). Kleene’s Theorem tells us that regular expressions and finite state automata …
Nov 09 2017
Not String Theory – String Facts
As a computer programmer for more than a quarter of century, I don’t think I have ever thought much about strings. I knew the basics. In every language I’d worked with, strings were a data type unto themselves. Superficially they are a sequence of characters, but behind the scenes, computers store and manipulate them as …
Oct 12 2017
Binary Boolean Logic Functions
Boolean functions, sometimes also called switching functions, are functions that take as their input zero or more boolean values (1 or 0, true or false, etc.) and output a single boolean value. The number of inputs to the function is is called the arity of the function and is denoted as k. Every k-ary function …