This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness. This discussion will address the two upper levels of Marr's Level Theory: the computational…

This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted…

This article gives an overview of the new field of complexity theory which links computer science to mathematics, and ultimately to the solution of theoretical as well as practical problems in society and technology. (Author/MK)

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)