Primitive Recursion in JavaScript - ML Research Project DevLog - [005]

In this video I cover primitive recursive functions to give a sense of how I conceptualise the composition of higher order math functions. The purpose of understanding this concept from the ground up is to better handle building more complex structures out of basic primitive building blocks of other functions. This is essentially how I interpret lambda calculus and how I expect to update Bayesian models independently of one another while they're all stitched together.

In another of my recently recorded videos I demo an introduction to the 'React' javascript framework meant for app development and web design to illustrate how I plan to render trees of components without re-rendering entire hierarchies all together. I'm going to want to implement this type of rendering lifecycle for updating models combined with a tree structure of linked state machines to optimise the rendering behaviours of primitive AI models to higher order controllers / schedulers (as I call them, for lack of a better term at the moment).

This video, and others along a similar vein, are intended to help me think through how I might approach this or translate this coordination when I migrate AI models into Blender for visualisation and training in the 3D graphics engine. It's abstractly but not directly related to the project's potential implementation details. I'll have to do a bit more research into how React works under the hood if I'm going to be able to reconstruct a similar rendering pipeline as the DOMtree nodes in a web browser, but the idea of recursive functions and component containers needed some mastication first.

My original recorded attempt at recursion in JavaScript (longer, more thorough explainer) on my podcast channel "Frivolous Gravitas" as a youTube exclusive extra: https://www.youtube.com/watch?v=khaCHAiDCi0

Intro Music Produced by Kid Flash
Outro Music Produced by Don P