Back
[01:25:29] <katsmeow> gnites
[08:14:33] <Tom_itx> snow on the ground
[12:54:40] <rue_house> haha
[13:13:44] <rue_shop3> from an owl: "The secret to looking wise, is to issue wisdom in a lecturious tone, and to choose your questions carefully."
[13:13:50] <rue_shop3> "who?"
[13:30:21] <^kat^> rue, why do we need a cpu at all?
[13:33:40] <^kat^> everything we know, every function we learn, is in *memory*
[13:36:29] <^kat^> a multi-statemachine with just enough local memory to know what it's currently doing, it spits out sequential memory addresses for the assigned function until it's about to step on it's own toes, then it pawses only until it's caught up with itself
[13:37:43] <^kat^> simple machines, simple ram organisation of the type: functionname(parms,vars,destination) , all in one memory word
[13:38:40] <^kat^> functionname might be multiply , or add,, or move
[13:39:40] <^kat^> vars get locked until the function is done with them, if the next instruction tries to access those vars before functionname() unlocks them, that instruction is not executed, it's stacked
[13:40:14] <^kat^> that's the limit of that node/neuron remembery
[13:40:57] <^kat^> so var names and functionnnames become a pointer themselves into some area of ram
[13:42:18] <^kat^> the mmu spits out an addy, the memory spits out a gigantic word, part of the word triggers a functionname which shunts the params and varnames into it's subnode, and it does things
[13:43:00] <^kat^> any time after that it sees those varsnames on the buss, it issues a stack/do-no-execute flag
[13:43:09] <^kat^> until it's done with them
[13:44:06] <^kat^> when it's done it issues a done flag, and the mmu runs it's stack of flags signed by that functionname, and executes them
[13:45:18] <^kat^> this way it's inherently multiscalar without the compiler or programmer having a clue
[13:47:37] <^kat^> the mmu would need to handle dependancies, or the functionnames must be able to lock huge spans of local memory, so operating on one var of a list locks the var from any use, and locks the list from being moved
[13:50:06] <^kat^> so, we need some cheap 150Mhz 256-word 256bit srams
[13:52:05] <^kat^> if you have a network in a box, such that any node not working becomes a subnode, and any subnode can outlive it's starternode.... well.... i forgot
[13:54:19] <^kat^> any time the net can assign a distributed task to 200 of it's 150Mhz nodes, then the box's burst speed at that time hits 30Ghz
[13:54:59] <^kat^> that is all
[18:22:22] <rue_shop3> thats going to take me a while to read thru