Imprint | Next page

The 3 mental spaces

Human, computer, objective.

I want to build a team now

No more working alone!

Our brains have 2 parts

...and they're (probably) not the ones you think.

Phrase Corrector

Approaching AI, chapter 915423

One User Second

...should be enough time for a bot to respond.

The two fundamental ways to make a chat bot

Recognizing things on a screen

More edutainment for your pleasure!

First easter without a death wish

Now if that isn't a change. Videos about AI coming.

Whenever my language bores me

...I shorten it. Let's say I want to make a big input field with full persistence and switchable font size (like you see on the right). Then I write this:

cmodule BigInput {
  S text; // auto-persisted string field
  switchable int fontSize = 40;
  visual setFontSize(fontSize, dm_textArea('text));

(I just created the 2 new JavaX syntax constructs 'switchable' and 'visual' in like 10 minutes. Hover over the source code for more info.) —Automatic popup menu.

New stuff to test

If this runs, you're read-d-dy for making a bot. (Actual software coming up.)

New domain [in preparation] - in two minutes to your bot. And it's free

From dialog to chat bot 101

(In a few steps, that is.)

What time is it?
It's 5:30
Why did you say that?
Because you asked me what time it is.

Bots now available 'standalone'

One huge jar file. Includes a GUI and a database. And learns from the cloud while running.


...will explain itself (as a general principle).

First professional bot being built

Not sure if I'm allowed to tell you more yet... :-)

My OS is really happy with 8 GB of RAM

...and any Windows installation. Enough space for AI experiments—and enough space for memory-hungry Firefox. Try it out yourself!

Accommodating human stuttering

Yes, it's all automatic. The original rule is just matching for "what's the rule count".

Coder muscle flexing :)

Sometimes I just have to do this—coming up with a really intelligent little solution for common coding questions that, oddly, don't seem to have an answer yet.

Like this one: How to find out efficiently whether a prefix of a string is contained in a tree set.

PS: Haha, now StackOverflow is saying they want to delete the answer. I was improving on another answer which apparently is not being deleted? StackOverflow is complete madness as I have said before.

Mini-investment needed

Sorry... I can't always turn water to wine. Need some grapes. Details.

I just made Gazelle scalable

10,000 rules shouldn't be a problem at all. We do want AGI, don't we?

Imprint | Next page