Syntactic sugar

"In computer science, syntactic sugar in a language is syntax designed to make things easier to read or to express, while alternative ways of expressing them exist."

## Sunday, June 28, 2009

## Thursday, June 11, 2009

### Jerboa - Wikipedia, the free encyclopedia

Jerboa - Wikipedia, the free encyclopedia: "The jerboa (from Arabic يربوع yarbū' or Hebrew יַרְבּוֹעַ yarbōa' ) form the bulk of the membership of the family Dipodidae. Jerboas are jumping desert rodents found throughout Asia and Northern Africa."

### Levenshtein distance

Levenshtein distance

"In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance)."

"In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance)."

## Wednesday, June 10, 2009

### Cellular Potts model

Cellular Potts model

"The cellular Potts model is a lattice-based computational modeling method to simulate the collective behavior of cellular structures."

"The cellular Potts model is a lattice-based computational modeling method to simulate the collective behavior of cellular structures."

## Tuesday, June 09, 2009

### St. Petersburg paradox

St. Petersburg paradox

"In economics, the St. Petersburg paradox is a paradox related to probability theory and decision theory. It is based on a particular (theoretical) lottery game (sometimes called St. Petersburg Lottery) that leads to a random variable with infinite expected value, i.e. infinite expected payoff, but would nevertheless be considered to be worth only a very small amount of money."

"In economics, the St. Petersburg paradox is a paradox related to probability theory and decision theory. It is based on a particular (theoretical) lottery game (sometimes called St. Petersburg Lottery) that leads to a random variable with infinite expected value, i.e. infinite expected payoff, but would nevertheless be considered to be worth only a very small amount of money."

## Monday, June 01, 2009

### De Morgan's laws

De Morgan's laws

"In formal logic, De Morgan's laws are rules relating the logical operators 'and' and 'or' in terms of each other via negation, namely:

NOT (P OR Q) = (NOT P) AND (NOT Q)

NOT (P AND Q) = (NOT P) OR (NOT Q)"

"In formal logic, De Morgan's laws are rules relating the logical operators 'and' and 'or' in terms of each other via negation, namely:

NOT (P OR Q) = (NOT P) AND (NOT Q)

NOT (P AND Q) = (NOT P) OR (NOT Q)"