This morning I came across an inviting link on Hacker News, Nondeterminism, part of the Teach Yourself Scheme in Fixnum Days. There are a number of chapters which help new comers to Scheme dig in and get a feel for the language. This chapter discusses McCarthy’s amb operator, describes a rules based implementation, and offers several example applications. (more…)
Tag: probe
Is there a Moore’s Law for Machine Intelligence?
Transient Technology, how probe may handle interface mapping
The intentional interconnection of technology happens at surfaces that are matched*. No matter how well thought out, interface assumptions must iteratively adapt to a dynamic data environment. Information and data rarely maintain the same formats, rates, and sizes over time. As much as I’d prefer to never have to write another data reformatter, it is silly to expect other technologies to stand still. What happens when an interface changes, but all of the needed data to satisfy that new interface is readily available? A developer has to go back into that code and manually write up a new interface or retrofit the existing interface to maintain backwards compatibility. This usually produces some hard to maintain and read code over time. Old code has a way of evolving into a thing out of nightmares.
Probe: A fictional programming language
This morning’s riff is a beginning for a new programming language which may end up being a dialect or library of an existing language after I take a look at what I’ve written. I’ll begin with an example of how I’d like code to look and function, and then wrap up with some design priorities and benefits. I would like a language that makes the process of learning easier and more streamlined. Probe stands for anything you want. At the moment for me probe stands for PROgram By Essel, PROgram BE, Produce Relational Ontologies By Example, and/or Pattern Refined Organization Born Easily 
.