frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

The Legend of von Neumann (1973) [pdf]

https://gwern.net/doc/math/1973-halmos.pdf
159•suopspaces•4h ago•86 comments

Dutch Computer Museums

https://aresluna.org/dutch-computer-museums/
8•npollock•28m ago•1 comments

Tiny Brutalism

https://placeholders.itch.io/tiny-brutalism
49•abetusk•17h ago•6 comments

Court agrees with EFF: Utah's VPN law demands a technical impossibility

https://www.eff.org/deeplinks/2026/10/court-agrees-eff-utahs-vpn-law-demands-technical-impossibility
58•hn_acker•18h ago•12 comments

Supabase is acquiring Turso

https://supabase.com/blog/supabase-is-acquiring-turso
103•cvburgess•1h ago•50 comments

FLUX 3 Image

https://bfl.ai/models/flux-3-image
69•minimaxir•21h ago•4 comments

ICC judge on what U.S. sanctions mean for her and global courts

https://www.npr.org/2026/10/01/nx-s1-5977815/trump-icc-sanctions-kimberly-prost
17•rbanffy•18m ago•0 comments

Show HN: Giving Opus 5.5 a simulated paint canvas

https://stillwet.art/
60•alstonite•16h ago•11 comments

Giving friends custom text buzzes based on Morse code

https://liquidbrain.net/blog/giving-friends-custom-text-buzzes-based-on-morse-code/
30•evakhoury•22h ago•13 comments

Shimano Bicycle Museum Review

https://inrng.com/2026/10/shimano-bicycle-museum/
260•pietroppeter•12h ago•61 comments

Sites in ChatGPT

https://chatgpt.com/features/sites/
16•polvi•18h ago•18 comments

Nazi Germany had no hope of making an atomic bomb, uranium cubes reveal

https://www.science.org/content/article/nazi-germany-had-no-hope-making-atomic-bomb-uranium-cubes...
48•xqcgrek2•15h ago•11 comments

Several vulnerabilities have been discovered in the Linux kernel

https://lwn.net/Articles/1097401/
500•luispa•18h ago•361 comments

To grieve, or not to grieve?

https://xenaproject.wordpress.com/2026/10/01/to-grieve-or-not-to-grieve/
97•stabbles•1d ago•84 comments

Show HN: Audionaut – an open-source cross-platform multitrack audio editor

https://github.com/kvoltmer/Audionaut
111•vltmrkls•9h ago•38 comments

The Four Horsemen of Agentic Coding

https://distantprovince.substack.com/p/the-four-horsemen-of-agentic-coding
66•haute_cuisine•2h ago•35 comments

Limited Liability In Historical Perspective (1997) [pdf]

https://scholarlycommons.law.wlu.edu/cgi/viewcontent.cgi?article=1623&context=wlulr
8•gradus_ad•16h ago•3 comments

Fixing GRPO's credit assignment problem without evaluating every step

https://arxiv.org/abs/2609.36178
15•mrkn1•2h ago•0 comments

Frog and Toad and the Increasingly Capable Machines

https://www.frogandtoad.ai/
476•supermdguy•18h ago•110 comments

Clef: Open-weight decision models, and new RL fine-tuning platform

https://blog.cloudflare.com/clef-decision-models/
598•jasondavies•1d ago•213 comments

Now That's an Impurity Story

https://www.science.org/content/blog-post/now-s-impurity-story
26•dcminter•20h ago•1 comments

SvelteKit 3

https://svelte.dev/blog/sveltekit-3-is-here
376•sampsn•21h ago•161 comments

Power approval set to delay Oracle's Wisconsin AI datacenter

https://www.theregister.com/on-prem/2026/10/02/power-approval-set-to-delay-oracles-wisconsin-ai-d...
35•Betelbuddy•1h ago•5 comments

Show HN: Breadcrumb, record everything on your mac + context manager for AI

https://innerloop.works/breadcrumb
22•jv22222•23h ago•5 comments

Git 3.0's upcoming SHA-256 default will be a costly mistake

https://blog.gitbutler.com/git-3-sha-256
524•chmaynard•1d ago•481 comments

Pi 1.0

https://earendil.com/posts/pi-1-0/
1610•sergiotapia•21h ago•551 comments

Pi Durable

https://earendil.com/posts/pi-durable/
473•paulsmith•21h ago•65 comments

DeepSeek Harness Desktop for macOS and Windows

https://www.deepseek.com/en/harness/
369•Kuyawa•14h ago•190 comments

Ask HN: Who is hiring? (October 2026)

251•whoishiring•1d ago•246 comments

Turbo Haskell

https://comonad.com/reader/2026/turbo-haskell/
186•pjmlp•1d ago•47 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/