Tuesday, 26 July 2005 16:14Computer science is an art. It is the brain's work solidified into physical form. Interactive, empowering, consistent, and beautiful. I love programming.
Computer science - Wikipedia, the free encyclopedia
What is Computer Science?
P versus NP problem - Wikipedia, the free encyclopedia
THE WORLD’S TECHNOLOGICAL CAPACITY TO STORE, COMMUNICATE, AND COMPUTE INFORMATION
GitHub - sindresorhus/awesome: A curated list of awesome lists
Acmeism - Programming Has No Borders - open technology that serves all languages as equally as possible.
cortesi - The impact of language choice on github projects
Programming Languages - Hyperpolyglot - look at syntax differences between languages...
I enjoy the dining philosopher problems. The silent, two-hand eating, thinking philosopher problems. forks, chopsticks, pasta, meatballs, whatever. Just get me food, and let me think. it isn't an easy problem; keeping a philosopher fed without contention...
Dining philosophers problem - Wikipedia, the free encyclopedia
De Morgan's laws - Wikipedia, the free encyclopedia - because it shows up everywhere, in source, in hardware, De Morgan's Law. or's flipping to and's, negation. it is a law.
Inheritance and Interfaces
Integration of the Classbox Concept in the .NET Framework
Wikipedia List of Algorithms
NIST: Dictionary of Algorithms and Data Structures
in awe of sortsA neat page that has visual representations of most sorting algs. Sorting
PyAlgoViz - Home
Robert Penner's Easing Functions
Smooth interpolation of irregularly spaced keyframes
jsm174/libtween - libtween is a tweening engine written in C.
Tree traversal - Wikipedia, the free encyclopedia - oh and my other page on graphs...Graphs - Dave Horner's Website
Recursion best practices - Carpe diem (Felix's blog) - recursion is hard to write, and even harder to write it well. To iterate is human, to recurse, divine.
Big-Ohh || Big-O || algorithm complexity analysisBig O notation - Wikipedia, the free encyclopedia
Big-O Algorithm Complexity Cheat Sheet
Time complexity - Wikipedia, the free encyclopedia
A Gentle Introduction to Algorithm Complexity Analysis - Big Ohh so gentle.
Programmers' Daycelebrated on the 256th (hexadecimal 100th, or the 2^8th) day of each year (September 13 during common years and on September 12 in leap years). 256 is the highest power of two that is less than 365, and just so happens to be the size of a byte.
Programmers' Day - Wikipedia, the free encyclopedia
Honeycombs - Rosetta Code - games of coding in which the game is to provide another solution in another language...
Bit manipBit Twiddling Hacks
(unsigned ints of course)
x=1;y=2;x^=y;y^=x;x^=y : swap to variables without intermediary.
number & 1 == 0: even.
number << 1 : double number
number >> 1 : half number
sometimes it's best to leave optimization to the compiler, and the code for humans to read...
Design patternsDo programmers have any specific superstitions? Yeah, but we call them best practices.
asio Design: Proactor
SMC: The State Machine Compiler Galois › Blog › Blog » Theorem Proving for Verification
Fan Programming Language - interesting programming language. Compiles to Java VM or .NET CLR. Awesome, will it get traction?
Atul's Mini-C Compiler - C compiler written in python.
What Every Computer Scientist Should Know About Floating-Point Arithmetic
apfelmus - Monoids and Finger Trees
CoffeescriptInteractive Smooth CoffeeScript
Conway's Game of Life - conway.coffee - written using coffee.
Game of Life - David Elentok's coffee implementation.
CoffeeScript Quick Reference
Underscore Reference — Smooth CoffeeScript
SmalltalkSqueak Smalltalk -Squeak is a modern, open source, full-featured implementation of the powerful Smalltalk programming language and environment.
Traits: Composable Units of Behaviour (pdf)
LuaMoonScript, a language that compiles to Lua
LÖVE - Free 2D Game Engine - 2D games in Lua. It's free, open-source, and works on Windows, Mac OS X and Linux.
Learn Lua the Hard Way | Sanity Phailed.me
Jim Tcl - The Jim Interpreter - Jim is an opensource small-footprint implementation of the Tcl programming language. It implements a large subset of Tcl and adds new features like references with garbage collection, closures, built-in Object Oriented Programming system, Functional Programming commands, first-class arrays and UTF-8 support. All this with a binary size of about 100-200kB
conways game of life and other cellular automataConway's Game of Life - Wikipedia, the free encyclopedia
Cellular automaton - Wikipedia, the free encyclopedia
Mirek's Cellebration - 1-D and 2-D Cellular Automata viewer, explorer and editor by Mirek Wojtowicz
Science vs Magic
Cellular Automata FAQ - Conway's Game of Life
victusfate/life @ GitHub - conway's game of life with coffeescript and html5 canvas
complexity | suspended-chord.info
did you know that if you google "conway's game of life, they have an implementation on the search result page...
Conway's Game of Life - JSFiddle - ankr's canvas.
Gliders in "Life"-Like Cellular Automata
nerds our sexy damesThe Never-Before-Told Story of the World's First Computer Art (It's a Sexy Dame) - Benj Edwards - The Atlantic - if the pin-up displayed correctly on the screen, then data was being transferred between the A and B computers correctly..or a pretty picture to stare at while at work.
Lenna - Computer vision - Lena is in quite a few respectable books..
Jason Scott: The Atomic Level of Porn on Vimeo
hardware of oldAtari VCS game console
ASCII by Jason Scott
Fixing E.T. for the Atari 2600
Assembly Language asmNASM Manual - The Netwide Assembler: NASM - NASM, the Netwide Assembler: an assembler targetting the Intel x86 series of processors, with portable source.
RDOFF - Wikipedia, the free encyclopedia
IR is better than assembly — Idea of the day
You and Your Research - Hamming, "You and Your Research" (June 6, 1995) - YouTube - the unexamined life is not worth living; examine your life. right problem, at the right time, in the right way. style is everything. now that I've told you these things-- these things no one told me. I've told you how to succeed: you have no excuse not doing better than I did.
Jennifer Dewalt - 180 websites in 180 days
Quines && QlobesQuine (computing) - Wikipedia - A quine is a computer program which takes no input and produces a copy of its own source code as its only output.
The Quine Page (self-reproducing code)
mame/quine-relay - An uroboros program with 50 programming languages. Ruby program that generates Scala program that generates Scheme program that generates ...(through 50 languages)... REXX program that generates the original Ruby code again.
Quines (self-replicating programs)
mamememo - mamememo: The Qlobe - a ruby implementation, actually may be original, not sure...
Martin Kleppe: 1024+ Seconds of JS Wizardry -- JSConf EU 2013 - YouTube - talk which includes discussion of the above JS Qlobe.
Hardest problem of all. Naming things."There are 2 hard problems in computer science: cache invalidation, naming, and off-by-1 errors"
Ontology (information science) - Wikipedia - Computer scientists are more concerned with establishing fixed, controlled vocabularies, while philosophers are more concerned with first principles, such as whether there are such things as fixed essences or whether entities must be ontologically more primary than processes.
When I can no longer tell whether my implementation is faithful to the semantics or not.
Introduction Use Intention-revealing Names - Object Mentor (PDF)
Naming Tips - Software Engineering Tips
The 4 Most Important Skills for a Software Developer | Javalobby - When people ask me what I do all day, I mostly say "read things other people name and name things."
Semantics - Wikipedia, the free encyclopedia
Finite State Machines || State Transition Tables || FSMThe machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition; this is called a transition. A particular FSM is defined by a list of its states, and the triggering condition for each transition.
Finite-state machine - Wikipedia, the free encyclopedia
State transition table - Wikipedia, the free encyclopedia
Building a Finite State Machine Using DFA::Simple - Perl.com
SMC: The State Machine Compiler
ef.gy :: Finite-State Machines with recursive SQL
QP active object frameworks for embedded systems by Quantum Leaps - active objects keep tasks data local to the task itself,async eventing, tasks process events one at a time to completion. TI Stellaris support!
QP (framework) - Wikipedia, the free encyclopedia - hierarchical state machines - UML statecharts , C/C++
Code and Life – Tutorial: State Machines with C Callbacks
Knock knock Race condition Who's there?— I Am Devloper (@iamdevloper) November 11, 2013
Daniel J. BernsteinDaniel J. Bernstein - Wikipedia, the free encyclopedia
D. J. Bernstein - personal website
djb (Aaron Swartz's Raw Thought) - I think it’s time to remind people that D. J. Bernstein is the greatest programmer in the history of the world.
skalibs: the djb legacy - Who is this DJB guy, and why is he so special anyway? So, in short, DJB is not a guru, I'm not a mindless brainwashed fan, and the "DJB advocates" are not a cult. We just think DJB brought something to Unix and more generally to the software programming world; we learned from him, we write software following sound principles that he was one of the first to really apply, and we give credit where credit is due.
< Prev Next >
Last Updated on Sunday, 27 March 2016 17:29