Is there a phrase or word to describe an algorithim or program is complete in that given any value for its arguments there is a defined outcome?
Is there a phrase or word to describe an algorithim or programme is complete in that given any value for its arguments there is a defined outcome? i.e. all the ramifications have been considered ...
I have ran into the above phrase many times (especially during classic VB days) and I have been wondering what it really mean and where it originated from. Any ideas?
The danger of ever suggesting some feature on a product, especially open source, is that you'll get the response, "why don't you do it?". That's valid, and it's cool that you can make the change ...
The other day someone asked me what type of work I do. I answered that I help to build web sites (Asp.net, c#, mostly). So he said "so then you must do a lot of Web 2.0 stuff, right?". I proceeded ...