undefined | Better HN

story

0 pointsicey15y ago0 comments

The idea isn't to keep the generated version blessed; it's to get up to a minimum product as fast as possible instead of wasting time issuing generation commands over and over again.

This is all pseudo-implemented already; I'm just talking about adding a little more automation to an already repetitive process.

Either way, it's a problem that needs solving; just because it's hard doesn't mean it's not worth trying to fix, right?

0 comments

mathgladiator15y ago

http://blogs.tedneward.com/2006/06/26/The+Vietnam+Of+Compute...

I've tried for years working on it, and I even wrote a programming language (Kira: http://www.mathgladiator.com/projects/kira/ ) to solve this problem. I can attest that the problem... well, sucks.

If you want to get off the ground, then using a RDBMS isn't the way to go. The way I would recommend is to use object graph serialization then as the problems arise, use a database to index. I wrote about this here: http://blog.mathgladiator.com/2010/08/guide-to-databases-in-...

j / k navigate · click thread line to collapse

0 comments

mathgladiator15y ago

http://blogs.tedneward.com/2006/06/26/The+Vietnam+Of+Compute...

I've tried for years working on it, and I even wrote a programming language (Kira: http://www.mathgladiator.com/projects/kira/ ) to solve this problem. I can attest that the problem... well, sucks.

j / k navigate · click thread line to collapse