for delicious.el: 18:24 (tech_notes#218)

(add-to-list 'load-path "/~/delicious-el")
  (require 'delicious)
  (setq delicious-api-user "myusername"
        delicious-api-password "mypassword")
to .emacs.

a filesystem or environment becomes the work 12:05 (2006.08.11:4 research#56 tech_notes#217)

but aside form any consideration of the ACTUAL software

possible plans for a standard artistic/creative computing environment 11:34 (tech_notes#216)

specifying this environment and providing configuration and additional command-line tools and extensions to avoid wasting time checking through a huge range of packages.

Planner, GNU Emacs and: 11:06 (tech_notes#215)

1) delicious integration

2) bookmarks transfer from firefox to w3m

3) rss feeds (see planner-rss.el) and how subscription happens

from SICP: 11:01 (2006.08.11:1 research#55 xxxxx_at_piksel_notes#14 tech_notes#214)

In a similar way, we can regard the evaluator as a very special machine that takes as input a description of a machine. Given this input, the evaluator configures itself to emulate the machine described. For example, if we feed our evaluator the definition of factorial, as shown in figure x, the evaluator will be able to compute factorials.



In this chapter (five) we will describe processes in terms of the step-by-step operation of a traditional computer. Such a computer, or register machine, sequentially executes instructions that manipulate the contents of a fixed set of storage elements called registers. A typical register-machine instruction applies a primitive operation to the contents of some registers and assigns the result to another register. Our descriptions of processes executed by register machines will look very much like “machine-language” programs for traditional computers. However, instead of focusing on the machine language of any particular computer, we will examine several Lisp procedures and design a specific register machine to execute each procedure. Thus, we will approach our task from the perspective of a hardware architect rather than that of a machine-language computer programmer. In designing register machines, we will develop mechanisms for implementing important programming constructs such as recursion. We will also present a language for describing designs for register machines. In section 5.2 we will implement a Lisp program that uses these descriptions to simulate the machines we design.