サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
衆院選
www.cs.caltech.edu
CS11 Erlang - Winter 2012-2013 Track Info The CS11 Erlang track meets Tuesdays at 4:30pm in 314 Annenberg. Lectures are approximately one hour. Office hours and contact-info for this track are as follows: Donnie Pinkston (donnie AT cms): Wednesdays 2pm-4pm in 111 Annenberg Assignments Assignments are due one week after they are given. Assignments should be submitted via the csman website. If you n
Every computer language has "idioms", that is, typical ways of accomplishing given tasks. Python is no exception. Some of the idioms are not that well known, so we thought we'd collect them here. We're also adding some material on other interesting features of the python language that you might miss when reading an introductory tutorial. These items are roughly in order of their difficulty and how
www.cs.caltech.edu/~mvanier
This is an update to an old series of jokes about computer languages being like cars. I've added some more modern languages to the list. Any suggestions are welcome! Note: It seems that Digg/Reddit/StumbleUpon have dug/read/stumbled upon this page, with the result that I've received a ton of new suggestions. This is just an illustration of Vanier's Law: "Given enough time, any programming-related
This page is the official home page for GNU shogi, a program for Unix systems that plays Shogi (Japanese chess). The current maintainer is me, Mike Vanier. This is a maintenance release which makes it possible to compile GNU shogi without problems on modern Linux systems, and includes much better bitmaps for the pieces if you are playing the large size board (which is recommended). The release can
There will always be things we wish to say in our programs that in all known languages can only be said poorly. -- Alan Perlis NOTE If you're going to send me email comments about this article, please keep a few things in mind: I wrote this article a long time ago (in 2001, if memory serves), and frankly I'm not that interested in discussing it anymore. These days I'd rather write programs and tea
www.cs.caltech.edu/~westside
In this experiment, the photon first encounters a half-silvered mirror, then a fully silvered mirror, and finally another half-silvered mirror before reaching a detector, where each half-silvered mirror introduces the probability of the photon traveling down one path or the other. Once a photon strikes the mirror along either of the two paths after the first beam splitter, the arrangement is iden
www.cs.caltech.edu/~andre
このページを最初にブックマークしてみませんか?
『www.cs.caltech.edu』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く