frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

MiMo v2.6

https://mimo.xiaomi.com/mimo-v2-6
725•volf_•9h ago•333 comments

Spymarks, Not Watermarks

https://brand.io/article/spymarks/
270•possibilistic•6h ago•62 comments

Transformers Explained Visually

https://poloclub.github.io/transformer-explainer/
295•aray07•10h ago•46 comments

Attention is all you have

https://alicegg.tech/2026/09/21/attention
679•zer0tonin•15h ago•204 comments

What Sun got wrong

https://bcantrill.dtrace.org/2026/09/20/what-sun-got-wrong/
550•chmaynard•15h ago•315 comments

I don't want to read what you didn't write

https://blog.colinbreck.com/i-dont-want-to-read-what-you-didnt-write/
490•mooreds•7h ago•174 comments

NASA’s Mars Sample Return mission is dead

https://www.science.org/content/article/nasa-s-mars-sample-return-mission-dead
357•Muhammad523•10h ago•286 comments

AI coding has made CI a bottleneck, so we reworked ours to keep up

https://linear.app/now/ci-bottleneck-reworked
188•julian_digital•10h ago•196 comments

Looking forward to Git 2.56 – and 3.0

https://lwn.net/SubscriberLink/1094575/2385e98583715c2b/
70•chmaynard•6h ago•30 comments

Claude Status – Elevated errors for multiple models

https://status.claude.com/incidents/7g1qpkyz5gxh
89•corvad•4h ago•66 comments

Divide by depth for instant 3D

https://gabrieloc.com/2026/09/15/perspective.html
111•gabrieloc•2d ago•22 comments

Socrates vs. the Written Word (2011)

https://wondermark.com/socrates-vs-writing/
30•spectraldrift•5h ago•7 comments

The Advisory Group on Mathematics and Artificial Intelligence

https://terrytao.wordpress.com/2026/09/21/advisory-group-on-mathematics-and-artificial-intelligence/
116•digital55•10h ago•55 comments

PDF Forgeries Are Surprisingly Rare (2022)

https://gwern.net/blog/2022/pdf-forgery
19•1317•1d ago•16 comments

Truman World

https://trumanworld.live
18•trollied•1d ago•24 comments

First Shader from Zero in Godot 4

https://www.gdquest.com/library/first_shader_godot4_portal/
54•ibobev•18h ago•6 comments

Frontier AI on Your Own Hardware

https://timdettmers.com/2026/09/21/dlab-open-source-week/
133•pretext•10h ago•69 comments

How do traffic signals work? (2019)

https://practical.engineering/blog/2019/5/11/how-do-traffic-signals-work
76•at1as•13h ago•53 comments

Kev: Tiny Jev-like family of decision models built on top of Qwen3.5

https://github.com/jaredpalmer/kev/tree/main
425•tosh•22h ago•192 comments

Paper Models of Polyhedra

https://www.polyhedra.net/en/
15•pykello•2d ago•0 comments

More floating point alternatives

https://wizardzines.com/comics/floating-point-alternatives/
21•vismit2000•2d ago•15 comments

Epoll and Kqueue: How Operating Systems Learned to Wait Efficiently

https://thecodinggopher.substack.com/p/epoll-and-kqueue-how-operating-systems
4•adletbalzhanov•1d ago•0 comments

Python Workers are now generally available

https://blog.cloudflare.com/python-workers-ga/
203•torutofu•16h ago•36 comments

Turn off and restrict access to Apple Intelligence features on Mac

https://support.apple.com/guide/mac-help/turn-restrict-access-apple-intelligence-mchlb2e44f94/mac
271•alwillis•12h ago•185 comments

Grok 4.7

https://x.ai/news/grok-4-7
533•meetpateltech•13h ago•460 comments

HERMES radio enables voice and data communication over vast distances

https://spectrum.ieee.org/hermes-shortwave-radio-digital-data
116•SamuraiLion•13h ago•51 comments

Apple Copland D11E4 Booting in the Browser

https://www.pagetable.com/300
117•luu•11h ago•34 comments

Why does mathmain need an encrypted loader?

https://safedep.io/mathmain-encrypted-loader/
122•abhisek•11h ago•37 comments

TXR: An Original, New Programming Language for Convenient Data Munging

https://www.nongnu.org/txr/
29•andsoitis•1d ago•3 comments

Roboharm: Do frontier robot policies refuse unsafe instructions?

https://robocurve.org/roboharm/
43•msadowski•10h ago•21 comments
Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•1y ago

Comments

buildsjets•1y ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•1y ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•1y ago
(2003)
throw0101b•1y ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•1y ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•1y ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•1y ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•1y ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/