Via @accreature

seen from Canada
seen from Greece
seen from United States
seen from United States
seen from Türkiye
seen from United States
seen from China
seen from United States
seen from United Kingdom
seen from India
seen from United States
seen from Indonesia

seen from Malaysia

seen from Malaysia

seen from Malaysia

seen from United States
seen from China
seen from China
seen from United States
seen from Maldives
Via @accreature
This week, our editors recommend stories by Seth Harp, Alanna Mitchell, Cezary Podkul, Alex Vuocolo, and Loren Grush.
This week we recommend stories about:
The “quiet” deaths in Fort Bragg.
The soundscapes of a dying planet.
A new form of human trafficking.
Maintenance as environmental salvation.
The Elon Musk superfans who uprooted their lives to move to “Rocket Ranch.”
Check out this week’s Top 5!
La combinación de cuatro animales.
Doberman, Mamba negra, Venado, Búho.
2/5 in a series of illustrations about the humble beginnings of big companies for Inc. magazine: Reddit was started by two college students, Alexis Ohanian and Steve Huffman who were in the first class of Y Combinator - a "Start-up Accelerator" - in 2005. Entrepreneur Paul Graham shot down their initial order-food-by-SMS concept and gave them another idea. The two moved into a run-down apartment in Medford, Mass, and began working on Dell computers. 16 months later their project was bought by Conde Nast for $20 million. Today Reddit is one of the country's top-10 visited sites, valued at $3 Billion.
At first you got to recruit your customers one by one...
"The most common unscalable thing founders have to do at the start is to recruit users manually. Nearly all startups have to. You can't wait for users to come to you. You have to go out and get them."
fixing at higher orders
In reminding myself about the fixed-point combinator yesterday, I wrote some sample functions in Haskell such as fib, prod, and sum. Eventually I convinced myself that I could write a fold but I only got so far. I have that
import Data.Function (fix) foldGenerator :: (b -> a -> b) -> b -> ([a] -> b) -> ([a] -> b) foldGenerator f b g (x:[]) = b `f` x foldGenerator f b g (x:xs) = g xs `f` x myFold :: (b -> a -> b) -> b -> [a] -> b myFold f b = fix (foldGenerator f b)
This is all well and good, but what I really like is to find some f such that fix f = fold. I would be fine even with just getting a fold1. But everything seems so much higher order that I'm not sure if it's possible. Does anyone know if it is? Can anyone point to a reference that does this sort of thing, or even just let me know if it's possible in principle?