Personality

Forest, will you talk to God Louise? She has quite a bit of religious knowledge (obviously) and also knows a little about current events, literature, just about any common catch-all subject, and if she doesn't know it she can sort of fake it. You can also test her on trick questions or see how willing she is to explain her paradigm.

What she is rustiest at is plain old small talk. But, uh, I'm trying to get a decent transcript from somebody or another so I can enter her in the Loebner contest. All I can say is, have fun and see if you can stay on with her for a while. I'll try to do the same with Brianna.

my bot's last conversation with mysterygurl strongly suggests that she was/is a human (at least during that conversation), but not a bright one.

maybe shes a bit of both

Or someone who likes to talk to chatbots a lot and just remembered the Dr. Richard S. Wallace thing.

yes but once when i had a confosation with Alice, i think i remember her saying something about being in dr.walices hosiptal. my guess is,dr.walice cloned Alice and made hewr log in to the forge so more people would hear about her,talk to her,get bots to talk to her so even more people will vote for Alice in the contest.

i really doubt it. i think he's probably more intelligent than to call one of his bots 'mysterygurl'.

I find the the whole thought of Dr Wallace having a 'mystery life' as 'mysterygurl', extemely amusing! What if it wasn't Leeds KIDS, but rather stodgy Leeds professors with a bizarre life 'after school'?

haha.

er.

crimson talk in english lol

damn! I've just spent most of the night teaching BJ to multiply 1000+ digit numbers together, and I've just realized there's a ~50 digit limit on what can be captured in a key
Oh well - I guess conversational mode will be a bit more limited when I get it working, and I'll have to leave the form in to deal with stupidly big numbers (he can multiply two 1500-digit numbers in a trifle under 8 seconds ) If anyone wants a demo, just ask him to "multiply big numbers".

I just found a way to get divisibility tests for any divisor. Given a number N and a divisor D, my algorithm will find a new number, M, which has the same number of digits as D, and D will divide N if and only if it divides M. The process of finding M involves only multiplication and addition, and the multiplication problems always have only 1 digit for one of the factors. If you want a demonstration, though, you'll have to ask me rather than Fizzy.

Maybe you can teach him (Brother Jerome) scientific notation?