[goaty]

Lockster made me do it,    and im just showing off.

https://www.youtube.com/watch?v=fW2VjLWWmQU&feature=youtu.be

[LOCKSUIT]

I am supreme goddess of all, master of none

[goaty]

here something more edumacational -  this actually highlights the forks - other than that its a bit of a cheating device.   

https://www.youtube.com/watch?v=8bv6nxm35rc&feature=youtu.be

Thanks Lock for giving me the big 1 gig text store.

[LOCKSUIT]

Don't forget to tell them it runs on GPU power!

[goaty]

heres my code to dispatch the video card.


<code>
 INVOKE(dc, derezz0, 0, views, nullptr, nullptr, 0, output_uav, 1, 1, 1 );  //derezz the closest match score
 
 views[0]=query_srv[0];
 for(j=0;j<PAGES;j++){views[j+1]=biblepage_srv[j];} 
 INVOKE(dc, runmatch, PAGES+1, views, nullptr, nullptr, 0, output_uav,  (BIBLEPAGE_SIZE*4*SQRTPAGES)/32, (BIBLEPAGE_SIZE*SQRTPAGES)/32, 1 );  //HERES THE BIG GPU BASTARD CALL!    //THIS THING CALLS 2048x2048x16 THREADS AND STILL GOES RELATIVELY QUICKISH.  its the limit of my little card.

 views[0]=query_srv[0];views[1]=output_srv;
 INVOKE(dc, stepquery, 2, views, nullptr, nullptr, 0, query_uav[1], 1, 1, 1 );  //step the query along.
 </code>

[goaty]

Looks like ive gone embarrassed myself again,  banned off all seven seas off the internet.

[LOCKSUIT]

The algorithm searches up to 250MB of text for an exact match on GPU. It comes out just as fast as CPUs in the end :P

[goaty]

But Lock,  you don't realize the beauty of the situation.

Its working acceleration structureless!   And that's going to mean something,  so back to work I go.

Next thing im adding is order invariance (which would work whether its linear search or not.)
Then it should yoda similar to sound,  itll start saying verbs like they are nouns.

and a synonym generator (its done simple, and words which have identical sorroundings become the same symbol,  and u do it as long as u want but it guarantees less sense each compounding.)

[LOCKSUIT]

My synonyms are way better ;)

GPU has it all spread on many cores like random access but it's as slow as CPU.

[goaty]

The more you say words are substitutable with each other, the more jumps your system gets, and then the more attention span you can give it for so much data in the system.

But - how do you get it to communicate instead of just spitting out a random story?

[Freddy]

But - how do you get it to communicate instead of just spitting out a random story?

I think that's why we're all here 

[WriterOfMinds]

So what's happening here exactly?  Are you just running Lock's generator on your computer?  Running Lock's generator with your own improvements?  Or is this a different generator entirely?

[LOCKSUIT]

Lock generators is wayyyyy better

This is just the most basic simple search engine running on GPU.

[goaty]

So what's happening here exactly?  Are you just running Lock's generator on your computer?  Running Lock's generator with your own improvements?  Or is this a different generator entirely?

Lock gave me an idea,  just to have 60 meg or so just raw ascii text then every new letter it just brute scans it with all the gpu power of my gtx980 -  that way I don't need to store it in a binary tree, and I can actually get lossy matching as well.

Turns out its pretty wasteful,  and it needs the proper binary tree to go faster.

I have an idea of how to get it chatting,  but I need a source of proper chat text,  and I then I have an idea that if I search during the jumps,  I can make the robot try and direct the other speaker to say a word,  or change their mood,  if I have that in the jump information.

I think that if I had videos of people chatting to each other,  I could use computer vision with computer audio,  to get a useful set of data,  but I think brute searching it all is a bit of a waste of time, (it was a failure, when I said it was running quick, I only meant because it was actually linear searching/brute forcing.)  so ill get back to it later.

[LOCKSUIT]

I proved tree storage is worse, you waste RAM like no tomorrow. You can see my new little invention has extra low mem and extra fast search. Btw, for Next Word prediction, searching 1GB as 1Search is not long at all. That is not issue...

Actually let me think about binary trees while I sleep, I know of a way i think that stores them without the huge overhead they make.