dicroce

Personally I'm not much of a fan of assert()'s... at least in the language I use the most (C++). It's not that I don't think you should validate the input ranges of parameters to functions its that in general exceptions are better.

Yup. The goal was guide rails.... it'll still let you do non optimal things... just not totally illegal things. Hopefully if you do it enough you can take the guide rails off and still know what to do.

Yes. PR's would be welcome on the core math engine.

My goal is to build it up to Calculus.

It uses https://capacitorjs.com/ and I'm super happy with this choice. I think it feels fast simply because solving simple algebra problems is very light work these days (and of course its all on device... so no waiting on the network).

I updated the underlying engine (and its live on the web version here: https://dicroce.github.io/wyrm/home.html). There is some new powers examples in the drop down. Irrational roots are a potential next step.

Try the x^-1 = 2 example and click Guide Me.

I'm adding at least basic support for random practice problems in the release I'll be dropping in a few days. If I can get to it I may also be adding a more gamified "practice" mode.

Yeah I added the popup that appears when you hover as a means of trying to counteract this. I'll be looking for more ways to communicate this.

This is actually a great find. I update the engine and the change is live on the web version. I will probably wait a couple of days on updating the mobile apps to see if any more fixes need to be made (there is a whole app approval process they have to go through and I want to minimize that).

I will definitely consider using more color... hmm...

The underlying math engine is written in typescript and is open source:

https://github.com/dicroce/wyrm_math

Probably it's most important feature for applications like this is that the id's of elements in the equations are stable (meaning, if an X has an id of 123 and a transformation moves it to the other side of the equals sign, it still has id 123... this allows you animate between states if you wish).

This is the approach I was wondering about.

These are the last days of software. Use the AI's and build cool shit NOW.

If you know about the distribution of keys you can do even better by factoring that knowledge into where you split.

This is actually pretty incredible. Cannot really argue against the productivity in this case.

Lego blocks are how I like to think about software components... They may not be the perfect shape you need but you can iterate fast. In fact my favorite software development model is just to iterate on your lego blocks until the app you need is some trivial combination of your blocks.

Ok, maybe someone here can clear this up for me. My understanding of B+tree's is that they are good for implementing indexes on disk because the fanout reduces disk seeks... what I don't understand is in memory b+trees... which most of the implementations I find are. What are the advantages of an in memory b+tree?

Exactly my thoughts.

They should have used HLS. Its still pulling, and the client controls the downshifts if required...

Isn't it just kinda a natural thing once you have the chain rule?

Most of us that are somewhat into the tech behind AI know that it's all based on simple matrix math... and anyone can do that... So "inevitibalism" is how we sound because we see that if OpenAI doesn't do it, someone else will. Even if all the countries in the world agree to ban AI, its not based on something with actual scarcity (like purified uranium, or gold) so someone somewhere will keep moving this tech forward...

Integrating my time series database (https://github.com/dicroce/nanots) as the underlying storage engine in my video surveillance system, and the performance is glorious. Next up I'm trying to decide between a mobile app or AI... and if AI local or in the cloud?

Holy shit, is this the squatting man? (strangely similar stick figure cave drawings dating to the same timeframe all over the world, and reproduced apparently with high energy plasma experiment).

https://medium.com/@rajkumarrr/history-mystery-the-squatting...

Not even close. Software can now understand human language... this is going to mean computers can be a lot more places than they ever could. Furthermore, software can now understand the content of images... eventually this will have a wild impact on nearly everything.

Doesn't even matter. The capabilities of the AI that's out NOW will take a decade or more to digest.

I actually wish that instead of docker & etc we had just gotten a better chroot... Or maybe just a new kernel syscall that is chroot()++.

I taught all my kids this way. Generally it really only takes a couple of hours.

I had two floppies: MSDos & QModem. With those two I could use BBS's to get everything else.

At least in the implementation I wrote the default way to provide the body was a string... which has a length. For binary data I believe the API could accept either a std::vector<uint8_t> (which has a size) or a pointer and a size. If you needed chunked transfer encoding you had to ask for it and then make repeated calls to write chunks (that each have a fixed length).

To me the more interesting question is how web server receive an incoming request. You want to be able to read the whole thing into a single buffer, but you don't know how long its going to be until you actually read some of it. I learned recently that libc has a way to "peek" at some data without removing it from the recv buffer..... I'm curious if this is ever used to optimize the receive process?

Pet Peeve Time: Suburban neighborhoods these days typically only have a few entrances and exits... The effect of this is that unless you live in that neighborhood you won't enter it... This makes the streets quieter because you don't have any traffic passing through.. but it means that the major arteries have to have higher speeds... which I think isolates those neighborhoods.