Jason (@k_springvale) 's Twitter Profile
Jason

@k_springvale

ID: 1679023999207223296

calendar_today12-07-2023 07:05:10

117 Tweet

37 Followers

239 Following

Clare Daly (@claredalyirl) 's Twitter Profile Photo

The only "values" the EU is interested in defending are its interests. The EU "Economic Security Strategy" is a clear bid to align the EU even more closely to the US' all-out efforts to hinder China's technological development. The weaponisation of knowledge must stop.

Jason (@k_springvale) 's Twitter Profile Photo

Answer to How should one stop worrying about the future (job, money, etc.) and start living happily? by Rafael Eliassen quora.com/How-should-one…

National Museum of Mathematics (@momath1) 's Twitter Profile Photo

How many sheets of paper are needed to make this cube? Find out April 26 at Folding Fridays. Visit momath.org/folding-fridays to register.

How many sheets of paper are needed to make this cube?

Find out April 26 at Folding Fridays.  Visit momath.org/folding-fridays to register.
Li Zexin (@xh_lee23) 's Twitter Profile Photo

🇺🇸Boston Dynamic Robot Dog ($75,000) 🇨🇳Unitree Robot Dog ($2700) I was once skeptical about China’s dog’s performance. Not anymore.

Jose Vega — Vote Vega & Sare! (@josbtrigga) 's Twitter Profile Photo

My friends and I confronted anti-China hawk and Richie Torres advisor Matt Pottinger at an Asia Society event. While Pottinger proposes dismantling China-U.S. relations and separating Taiwan from China (which will end up in WW3), I proposed instead that the U.S. and China are not

Lukasz Olejnik (@lukolejnik) 's Twitter Profile Photo

Chinese scientists have developed the best shortest-path algorithm in 41 years! A team from Tsinghua University has broken Dijkstra’s “sorting barrier” — the first improvement since 1984. The new algorithm runs in O(m \log^{2/3} n) time. Potential applications? Faster shorter

Chinese scientists have developed the best shortest-path algorithm in 41 years! A team from Tsinghua University has broken Dijkstra’s “sorting barrier” — the first improvement since 1984. 
The new algorithm runs in O(m \log^{2/3} n) time. Potential applications? Faster shorter