Computer Science

Computer Science


Daily tweets about computer science and related stuff @JohnDCook.

214759 followers  •  18 follow  •    •   https://t.co/vtMHCfZpoO

Turing-machines and λ-calculus are equivalent only w.r.t. the functions they can define. Maybe not complexity.

The difficulty of numerical integration increases exponentially with dimension. Not just for all known methods, but for all possible methods.

"You’ll hear that Monte Carlo methods are independent of dimension, and that they scale poorly with dimension. How can both statements be true?"

Kahan's method for computing a 2x2 determinant with fused multiply-add

To err is human, to catch an error shows expertise

Something I learned in the context of programming that I try to apply to writing prose: it’s better to not need an explanation than to have a good explanation.

Conway's cosmological theorem contains a weird and wonderful analogy between the look-say string sequence and chemical elements. [pdf]

"Weird and wonderful" was Conway's description.

Loading
Loading

Q: Why can’t programmers tell the difference between Halloween and Christmas? A: Because oct 31 = dec 25. #oldprogrammerjoke 

2015 is a palindrome in binary: 11111011111

RT @KenScambler : Legacy. Looks easy; should be done in half an hour I reckon.

tweet picture

'The hardest problem in computer science is not being an opinionated jerk about everything.' -- @ntakayama 

'The purpose of abstraction is not to be vague, but to create a new semantic level in which one can be absolutely precise' - Edsger Dijkstra

tweet picture

"Code is like poetry; most of it shouldn’t have been written." -- @MetaThis 

"What if there isn’t actually any use for a distributed ledger at all?"

More CS courses that don't exits but should: Reverse engineering undocumented software Living with ambiguous & contradictory specifications

Loading
Loading