January 17, 2003 by Chris on General

New Link: 3D Model Search

3D Model Search – Sketch views of your model and/or specify some keywords and get some downloadable models as results.(Submitted by: cc – )
To: > Graphics > 3D Graphics

January 17, 2003 by Chris on General

New Link: Business Owners Toolkit

Business Owners Toolkit – Resource of basic business info along with useful forms.(Submitted by: cc – )
To: > Business

January 17, 2003 by Chris on General

IE5 Mac CSS Bugs – Exploration of IE5’s CSS bugs on the Mac, with some comparisons to Mozilla.(Submitted by: cc – )
To: > Web Design > CSS

January 17, 2003 by Chris on General

QuickSQL – .NET app for interacting with MSSQL and MySQL (along with others).(Submitted by: cc – )
To: > Programming > SQL And Database Info

January 17, 2003 by Chris on General

DataVision – reporting engine similar to Crystal Reports.(Submitted by: cc – )
To: > Programming > Java

These are my links for July 20th through July 24th:

Ask HN: Best-architected open-source business applications worth studying? | Hacker News -
Monospaced Programming Fonts with Ligatures | Hacker News -
The language of choice - Propositional logic was discovered by Stoics around 300 B.C., only to be abandoned in later antiquity and rebuilt in the 19th century by George Boole’s successors. One of them, Charles Peirce, saw its significance for what we now call logic circuits, yet that discovery too was forgotten until the 1930s. In the ’50s John McCarthy invented conditional expressions, casting the logic into the form we’ll study here; then in 1986 Randal Bryant repeated one of McCarthy’s constructions with a crucial tweak that made his report “for many years the most cited paper in all of computer science, because it revolutionized the data structures used to represent Boolean functions” (Knuth).1 Let’s explore and code up some of this heritage of millennia, and bring it to bear on a suitable challenge: playing tic-tac-toe.
Then we’ll tackle a task that’s a little more practical: verifying a carry-lookahead adder circuit. Supposedly logic gets used all the time for all kinds of serious work, but for such you’ll have to consult the serious authors; what I can say myself, from working out the code to follow, is that the subject offers a fun playground plus the most primitive form of the pun between meaning and mechanism.

You’re encouraged to read with this article’s code cloned and ready