Hal Brain Design

Brains for Machines / Machines for Brains
Hal Brain Design
Nature -> Sensors -> Brain -> Motors -> Nature

[News][ Products ] [ Services ] [ InfoReq ]

In this website you will find a new, general, only method of designing brains for machines, robots and artificial life forms. If you want to copy biology, here is a system to build neurons. Now you can build a machine's brain, just like writing a computer program except that your program assembles instructions to assemble a machine, not lists in a computer. In thirty years you will be able to load a program into a machine and get an machine as output. (If we start now.) Meantime, here is the first machine language for building robotics.

Boolean algebra and switching algebra functions are switches. Data Stream functions are programmed computers. Data stream arithmetic completes arithmetic with the fundamental operators of addition, integration, subtraction and differentiation. Every function in this system is also a hardware HalNode. The algebra and HalNodes build HalTrees that map exactly to neurons. (A neuron is a combinatorial tree of HalNodes. The only way you can study natural brains is to build a model of them. Now you can do that with Hal algebra.) To see an example of design see Big Al.

This work was created from the research of Harold L. Reed who, after thirty five years of search, found the least brain function (3/29/1994) and a new mathematics. Now we can define exactly what a brain is and we can classify them, from 0, the null brain to brains of any size. Now we have hardware to build them and an algebra to design them.

To contact me; to get further information, click below: If you, or anyone you know, is interested in designing active machines, I would be happy to provide a link to you or them. Let me know who you are and we can work something out.

Contact Information
This takes you to a form where you can enter your name and address. No information is stored. There is also an email click. The form page returns here.

[news][ Products ] [ Services ] [ InfoReq ]

08/05/08