Reputation
3,044
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
1 12 22
Newest
 Yearling
Impact
~78k people reached

Feb
14
answered Examples of Finite State Machines
Feb
14
comment Why does the word “Pythonic” exist?
Maybe you need to look at the etymology. Before the language was named after a comedy troupe famous for their Flying Circus, the adjective Pythonic was used in reference to that troupe's work and that of others who were influenced by them.
Feb
14
comment Is it true that a stricter coding style is always better?
A 20-page style document (they do exist) is definitely stricter than a half-page one.
Feb
14
comment Do you count a Masters in CS as a negative?
And before you consider Oxbridge status degrees, where the M.A. requires graduating B.A. and waiting a few years.
Feb
13
comment Is Flash really superior to Java applets?
Anti-aliasing has been in Java since 1.2. I think it's more a case that people didn't take the time to learn how to turn it on.
Feb
12
answered Is Flash really superior to Java applets?
Feb
12
comment Is Flash really superior to Java applets?
ActionScript is just JavaScript with a different name. I'm sure people who wanted could have a long debate over whether it's higher level than Java, but at the language level the biggest difference IMO is dynamic vs static typing.
Feb
12
awarded  Critic
Feb
11
comment How is “SELECT *” read in English?
@omouse, what would be the set theoretical way to pronounce it? "Select universe"?
Feb
10
comment What is wrong with Java's generics?
@Trinidad, the reason Java generics aren't reified is that they were added later and backwards compatibility was desired. (Same reason that C#'s generics have some problems).
Feb
7
comment Is C++ suitable as a first language?
@Donal, I checked the CL's website before posting that to ensure I wouldn't be shown up as an old codger. You had to ruin it, didn't you? ;)
Feb
7
comment Is C++ suitable as a first language?
@Larry, Cambridge University's CS course teaches SML as the first language.
Feb
7
comment how to prove the complexity of an algorithm mathematically
@Thorbjørn, not strictly true. Big-O is an upper bound: Big-theta is a tight bound.
Feb
7
comment how to prove the complexity of an algorithm mathematically
"What counts as an operation" depends on the context. There was an interesting question recently on one of the SE sites about bubble sort being faster than quicksort when sorting on a tape, because then the cost of accessing an arbitrary element of the array isn't constant but depends on the position relative to the tape head - so the partition step of quicksort went from being O(n) to O(n^2).
Feb
6
comment What are some small, but extendable game ideas to use for inspiration?
Should this be on gamedev.SE?
Feb
5
awarded  Editor
Feb
5
answered Etymology of “String”
Feb
3
comment Should you sacrifice code readability with how efficient code is?
This could perhaps be expressed as "It's sometimes correct to replace a naive algorithm expressed in 5 lines of comments and 20 lines of code with a sophisticated algorithm expressed in 15 lines of comments and 5 lines of code".
Feb
1
awarded  Commentator
Feb
1
answered Most difficult subject/theory in Computer Science?