According to the rules of probability your chance of winning $1 is 1/2. The chances of $2 is 1/4, $4 is 1/8, ... and $2n-1 has a chance of 1/2n. Adding all the possible winnings together you get 1/2 + 12 + 1/2 + ..... but that is an infinite amount of money;
would you pay $1000 to play??.. even $100? Most people would not, and with good reason.
When Georges Leclerc, the Comte de Buffon simulated the game for a long period, he found that he would have only won $10,057 in 2084 games [This is in the age before computers, so he had a child flip a coin to simulate 2048 games, something in excess of 4000 flips of a coin]. That would be an average of about $5 per game if he worked in dollars.
レジスター依存： パイプラインなどで同時に実行される複数の命令が，同じレジスターを利用しようとすること。または，その関係。レジスター数の少ない x86 では頻繁に発生し，パイプラインをストールする原因になる。
レジスターリネーミング： x86 系は汎用レジスターが８個しか利用できないため，レジスター依存が起こりやすい。そこで，CPU に８個以上（８の倍数）のレジスターを持たせ，通常は隠しておき（隠しレジスター），レジスター依存が起こったときに隠しレジスターを動的に割り当てることで，レジスター依存を回避する手段。ただし，プログラマーが明示的に使えるレジスターの数は，x86 と同じ８個である。
We suggest that you implement context sensitive help in two steps:
(1) When the user hits ‘Command-?’, convert the pointer to a “?”.
(2) When the user selects anything on the desk top with the “?” pointer: an icon, a menu item, or a field in a document, make your program call the Help desk accessory and passes it a parameter that indicates which message should be displayed.
United States Patent 4,789,962
Berry , et al. December 6, 1988
Methods of displaying help information nearest to an operation point at which the help information is requested
Abstract
A method of, and placing help information on a convenient but unneeded portion of a screen. Help information, when called, is placed on the screen adjacent an operating point, and positioned such that needed information adjacent the point is not covered up or blocked from view.
Inventors: Berry; Richard E. (Georgetown, TX); Johnson; Steven E. (Austin, TX); Ruiz; Thomas M. (Austin, TX)
Assignee: International Business Machines Corporation (Armonk, NY)
Filed: July 30, 1987
What is a "Buddy Pounce"?
Gaim introduced buddy pounces a few releases before AOL came out with "Buddy Alerts." Despite this though, you could think of a buddy pounce as an Alert and get an idea of the most minimal uses of a buddy pounce. In reality, a buddy pounce is much like a macro, or a recorded action. When you set a pounce on someone, you choose from a number of events, such as sign on or someone going away, and then you choose from a number of actions. These actions include everything from playing a sound (like an Alert would do) to sending a message to the person, to executing a command. This action will occur the next time gaim detects the event, ie the next time the person in your buddy list who you have pounced signs on.
（誤訳じゃなかった）
To turn feathers into a usable product, they are first plucked from the birds at chicken-processing plants and then the hot, wet feathers are immediately hauled to Emery's plant. There the "undesirable parts" like chicken heads, feet, windpipes and fecal matter are sorted out from the truckload of feathers.
"They're not a nice sight, to put it mildly," Emery said. "And they don't smell very good, either."
＞ 今現状でPCの普通の市販チェスソフトにチェスのトッププロが敵わない http://en.wikipedia.org/wiki/Computer_chess
Chess-playing computers are available for negligible cost, and there are many programs (even the free GNU Chess, Amy, Pepito, Crafty, Beowulf and more)
that play a game that, with the aid of virtually any modern personal computer can defeat most master players under tournament conditions,
while top commercial programs like Shredder or Fritz have surpassed even world champion caliber players at blitz and short time controls.
http://en.wikipedia.org/wiki/Deep_Blue
The system derives its playing strength mainly out of brute force computing power. It is a massively parallel, 30-node, RS/6000, SP-based computer system enhanced with 480 special purpose VLSI chess chips. Its chess playing program is written in C and runs under the AIX operating system. It was capable of evaluating 200,000,000 positions per second, twice as fast as the 1996 version. In June 1997, Deep Blue was the 259th most powerful supercomputer.
http://en.wikipedia.org/wiki/Computer_Go
The strongest programs are as weak as players that have played the game for mere months, and are no match to a seasoned player.
In contrast, for chess there is a simple rule of thumb "knight and bishop worth 3 pawns, rook worth 5 pawns, queen worth 9 pawns, checkmate is infinitely bad"
http://en.wikipedia.org/wiki/Reversi
The best Othello computer programs can easily defeat the best humans. As early as 1980, the program The Moor beat the reigning world champion, and in 1997, Logistello defeated the human champion Takeshi Murakami 6:0.
This dominance is not seen in games like chess, where the best computers are about equal to the best humans (although the Hydra machine may soon change that), or
Go, where even average human players trounce the best computers.
200：「 i モード事件」 松永 真理 （角川文庫）：2005/10/27(木) 01:13:13
