
Kaledo Art

Andulka

⁂

Origami Around

@theartofmadeline
One Nice Bug Per Day
No title available
Lint Roller? I Barely Know Her
d e v o n
Game of Thrones Daily
Peter Solarz

blake kathryn
TVSTRANGERTHINGS
NASA
Sade Olutola

JBB: An Artblog!
todays bird
hello vonnie
Mike Driver
No title available

seen from Malaysia
seen from United States
seen from United Kingdom
seen from United States

seen from United States
seen from United States
seen from Türkiye
seen from United States
seen from United States
seen from France
seen from United States

seen from Brazil
seen from United States

seen from Malaysia

seen from United States
seen from United States

seen from United States
seen from United States

seen from Lithuania
seen from United States
@42codes
Portability and Robustness issues commonly found in shell scripts
match command-line arguments to their help text
If two statisticians were to lose each other in an infinite forest, the first thing they would do is get drunk. That way, they would…
I am big fan of shell scripts and so love to learn interesting stuff from other's shell scripts. Recently i came across the authy-ssh scripts which eases two-factor authentication for ssh servers. When i walk through scripts, i learned lot of cool things that i am going to share it with you.
This is mathematical section of the parent essay Gödel Incompleteness for Startups Gödel Numbering A formal system is just a collection of axioms and rules.
The Future of Computing, The Future of Computer Programmers - An Interview with Yukihiro "Matz" Matsumoto
A while ago I translated an interview with Matz done by a Chinese book publisher. The interview and the translation were well received, so this time I am translating another interview with Matz, done by Ito, the editor-in-chief from Japanese website Engineer Type. Since I don’t read Japanese, the translation is based on Turing Book’s Chinese translation.
The Chinese translator has done a great job translating the interview, but there are still many words and sentences lack sufficient context and therefore are difficult to grasp. I have put in many hours translating the text as well as doing researches to ensure the final article is readable. I hope you will enjoy it! :)
Read More
Can you always turn a recursive function into an iterative one? Yes, absolutely, and the Church-Turing thesis proves it if memory serves. In lay terms, it states that what is computable by recursive functions is computable by an iterative model (such as the Turing machine) and vice versa. The thesis does not tell you precisely how to do the conversion, but it does say that it's definitely possible.
The paper MegaPipe: A New Programming Interface for Scalable Network I/O ( video , slides ) h...
Paul Erdos talked about the "Book" where God keeps the most elegant proof of each mathematical theorem. This even inspired a book (which I believe is now in its 4th edition): Proofs from the Book.
If God had a similar book for algorithms, what algorithm(s) do you think would be a candidate(s)?
To write clean code, you must first write dirty code and then clean it. With pleasure I have been reading Clean Code by Robert C. Martin. T…
In The Hitchhiker's Guide to the Galaxy by Douglas Adams, the number 42 is the "Answer to the Ultimate Question of Life, the Universe, and Everything". But he didn't say what the question was! Sinc...
The easiest way to create and share beautiful presentations.
http://bigocheatsheet.com/
If you said, “Hey! That’s a TCP header diagram in Lego(TM)”, or perhaps, “Holy &^%@! That idiot made a TCP header diagram in Lego(TM)!”, then you’re exactly right! This is another one of those wild, wacky ideas that we dreamed up in the middle of one of my SANS classes (note to the SANS staff: shorter breaks might be a good idea). I bet my students never thought I’d actually do it.