simone.computer
simone.computer
· Simone Marzulli's personal website, feel free to click your favourite buttons! · Shared by 43, including Joscha Bach, 瑞拿頭, Stef Walter, Hans Bickhofe
colah.github.io
Visual Information Theory
· I love the feeling of having a new way to think about the world. I especially love when there’s some vague idea that gets formalized into a concrete concept. Information theory is a prime example of… · Shared by 40, including rohit, sircharlsxavier, 瑞拿頭, Gordon, Alexander Seifert, kaywa, Jeff Ammons
Jason Crawford
“10x engineers”: Stereotypes and research
5 min · · Do 10x engineers exist? And what does the term even mean, anyway? · Shared by 35, including Jelan Ong, 瑞拿頭, Matthew Turland
Stanford University
Video is better when the codec and transport work together.
9 min · · No. Are you sure? Your website looks like a startup company’s. It's just the HTML template! They all look like this. We promise, this is an academic research project at a university. The code is open… · Shared by 24, including 瑞拿頭, Philippe
bollu.github.io
A Universe of Sorts
10 min · · I show off minanim.js , a tiny, 100LoC, yet feature-complete library for building animations declaratively, and why someone would want to do things this way. Enjoy! The blue circle's animation is… · Shared by 21, including Kevin Marks 🏠kevinmarks.com xoxo.zone/@KevinMarks, Chris Heilmann codepo8@toot.cafe, 瑞拿頭, Simone Corsi 💻🚀
altwork.com
The New Way to Work
1 min · · Altwork’s objective is to redefine how your computer and workstation work with you; to support you in being more productive, comfortable, and healthy. Whether you need to sit, stand, collaborate or… · Shared by 17, including Scott Hanselman 🌮, Christopher D. Long, 瑞拿頭
veekaybee.github.io
IT runs on Java 8
6 min · · Sometime in 2011, I stumbled across an unassuming site called Hacker News. At the time, I was a data analyst working mostly with Excel and SAS, and almost all of the headlines there were foreign to… · Shared by 15, including 瑞拿頭
reaktor.com
Don't (guess)timate your projects, forecast with confidence
12+ min · · Shared by 13, including 瑞拿頭
golem.ph.utexas.edu
The n-Category Café
5 min · · I’ve been trying to understand the Riemann Hypothesis a bit better. Don’t worry, I’m not trying to prove it — that’s a dangerous quest. Indeed Ricardo Pérez-Marco has a whole list of things not to do… · Shared by 13, including 瑞拿頭, Christopher D. Long
𝔊𝔴𝔢𝔯𝔫
On Having Enough Socks
20+ min · · Personal experience and surveys on running out of socks; discussion of socks as small example of human procrastination and irrationality, caused by lack of explicit deliberative thought where no… · Shared by 12, including Howard Getson, 瑞拿頭
youtube.com
Cellular Automata: Rule 30 fed as input to Conway’s Game of Life
· A 1D cellular automaton, Rule 30 (bottom), being fed as input to a 2D cellular automaton, Conway’s Game of Life (top). Open-source code: https://github.com/e... · Shared by 11, including Charles Hoskinson, 瑞拿頭, Joscha Bach
medium.com
Evolving Regional Evacuation
7 min · · by Niosha Behnam — Demand Engineering @ Netflix · Shared by 8, including 瑞拿頭
youtube.com
Game of Life: Logic gates
· The logic gates NOT, AND and OR in the Game of Life. The Game of Life is a cellular automaton invented by John Conway in the late 1960s. I write about it in ... · Shared by 5, including 瑞拿頭
microship.com
Home Page - Nomadic Research Labs
10 min · · Nomadic Research Labs has been building technomadic adventure tools since 1983, and this is the archive of publications, technical documents, stories, and historical material. Major projects are… · Shared by 4, including 瑞拿頭
github.com
pchen66/pchen66.github.io
· 3D Interactive Visualization Projects. Contribute to pchen66/pchen66.github.io development by creating an account on GitHub. · Shared by 4, including 瑞拿頭
arxiv-vanity.com
The Fastest and Shortest Algorithm for All Well-Defined Problems
· An algorithm M is described that solves any well-defined problem
p as quickly as the fastest algorithm computing a solution to
p, save for a factor of 5 and low-order additive terms. M
optimally distributes resources between the execution of provably
correct p-solving programs and an enumeration of all proofs,
including relevant proofs of program correctness and of time
bounds on program runtimes. M avoids Blum’s speed-up theorem by
ignoring programs without correctness proof. M has broader
applicability and can be faster than Levin’s universal search, the
fastest method for inverting functions save for a large
multiplicative constant. An extension of Kolmogorov complexity and
two novel natural measures of function complexity are used to show
that the most efficient program computing some function f is
also among the shortest programs provably computing f. · Shared by 1, including 瑞拿頭