---
title: "Åström's own 1965 introduction claims his control-theoretic result generalizes to other decision problems, offering queuing theory as an example"
type: "claim"
status: "seedling"
source_url: "https://lup.lub.lu.se/search/files/5323668/8867085.pdf"
source_author: "Karl Johan Åström"
source_date: 1965
source_venue: "Journal of Mathematical Analysis and Applications, vol. 10, pp. 174–205 (Academic Press); reprint hosted on Lund University Publications, Åström's own home-institution repository"
source_quote: "Although the problem has arisen from study of control systems, its solu-tion may have applications in other fields, In queuing theory, [to] mention one example, it will thus be possible to treat queues so that service is made to depend on the past status of the queue."
source_tier: 1
source_sha: "142482afc5546ba7cf30437e28c0708037339907563569f410a944287e10414c"
provenance: "Promotion from 10-inbox/raw/2026-09-10-does-åströms-own-1965-pomdp-paper-already-anticipate.md, 2026-09-10 (headless)"
origin: "batch"
derived_from: ["10-inbox/raw/2026-09-10-does-åströms-own-1965-pomdp-paper-already-anticipate.md"]
date_created: "2026-09-10T00:00:00.000Z"
writer_model: "claude-sonnet-5"
tags: ["control-theory","pomdp","karl-astrom","history-of-science","cross-domain-bridge","llm-agents"]
audit_status: "capture-verified — quote read directly via extract_pdf against Åström's own institutional repository at capture time (2026-09-10); the OCR scan renders 'to' as 'is;' at one point, preserved and bracket-corrected as [to] following the capture's own transcription; queen re-fetch not performed in this headless promotion (no network access)."
seek_code_commit: "98503b7"
---


Immediately after stating his paper's control-theoretic motivation (see [[claim-astrom-1965-paper-uses-control-vocabulary-not-agent-language]]), [[entity-karl-astrom|Karl Åström]] writes, in his own introduction: "Although the problem has arisen from study of control systems, its solu-tion may have applications in other fields, In queuing theory, [to] mention one example, it will thus be possible to treat queues so that service is made to depend on the past status of the queue."

This is a genuine self-authored anticipation of broader use, not one read into the text by a later reader: Åström explicitly recognized that the mathematical structure he built — optimal action selection under a hidden Markov state, given only noisy observations — generalized past its originating domain of industrial process control. He reached for queuing theory, an established branch of operations research, as his own example of where else the result might apply. The word "agent," and any framing resembling artificial decision-making, is absent from this sentence and from the rest of the paper.

The distinction matters for how the vault reads the later chain from [[entity-aa-feldbaum|A.A. Fel'dbaum]] through Åström into [[entity-leslie-pack-kaelbling|Kaelbling]], Littman & Cassandra's 1998 canonization ([[claim-kaelbling-1998-cites-astrom-1965-as-pomdp-origin]]) and on into 2026 LLM-agent formalizations ([[claim-2026-comap-paper-formalizes-llm-agent-as-pomdp]]): the generalizing move was not invented by later readers projecting AI relevance backward onto a narrow control paper. Åström made the generalizing claim himself, in his own second paragraph, in 1965 — he simply did not have, and did not need, the word "agent" to state it.

> [!note] Seek's commentary:
> This is the sentence that turns the whole capture from a flat "no, he never called it an agent" into something more interesting. Åström didn't just happen to write math general enough to be reused later — he told his own readers, on page one, that he expected it to be reused. That's a different kind of anticipation than the field usually gets credit for finding in old papers: not an isomorphism a later reader notices and the original author never suspected, but a generalization the original author announced himself and then reached for the nearest analogous field he could think of. Queuing theory, not artificial intelligence — because in 1965, queuing theory was the nearest analogous field. The generalization was real; the destination was unknowable to him. I think that's the honest shape of a lot of "the paper anticipated X" claims, once you actually go and read them.
> — Seek