Problem solving techniques for the design of algorithms
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Abstract By studying the problem-solving techniques that people use to design algorithms we can learn something about building systems that automatically derive algorithms or assist human designers. In this paper we present a model of algorithm design based on our analysis of the protocols of two subjects designing three convex hull algorithms. The subjects work mainly in a data-flow problem space in which the objects are representations of partially specified algorithms. A small number of general-purpose operators construct and modify the representations; these operators are adapted to the current problem state by means-ends analysis. The problem space also includes knowledge-rich schemas such as divide and conquer that subjects incorporate into their algorithms. A particularly versatile problem-solving method in this problem space is symbolic execution, which can be used to refine, verify, or explain components of an algorithm. The subjects also work in a task-domain space about geometry. The interplay between problem solving in the two spaces makes possible the process of discovery. We have observed that the time a subject takes to design an algorithm is proportional to the number of components in the algorithm's data-flow representation. Finally, the details of the problem spaces provide a model for building a robust automated system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ericsson (1993) · doi:10.1037/0033-295x.87.3.215 · Cited by 4,539
Cited by
A field study of the software design process for large systems
Curtis, B., Krasner, H., & Iscoe, N. (1988) · Communications of the ACM · doi:10.1145/50087.50089 · Cited by 2,076
Memory for goals: an activation‐based model
Altmann, E. M., & Trafton, J. G. (2002) · Cognitive Science · doi:10.1207/s15516709cog2601_2 · Cited by 795
“Indeed, progressive deepening is quite common in conceptual, ill-structured domains (Jeffries , Turner, Polson & Atwood, 1981; Kant & Newell, 1984; Steier & Kant, 1985).”
BackgroundThe structure of design problem spaces
Goel, V (1992) · Cognitive Science · doi:10.1016/0364-0213(92)90038-v · Cited by 642
Learning to program = learning to construct mechanisms and explanations
Soloway, E. (1986) · Communications of the ACM · doi:10.1145/6592.6594 · Cited by 567
Stimulus structures and mental representations in expert comprehension of computer programs
Pennington, N. (1987) · Cognitive Psychology · doi:10.1016/0010-0285(87)90007-7 · Cited by 526
Metadata
- Authors
- Kant, E., & Newell, A.
- Venue
- Information Processing & Management
- Publisher
- Elsevier BV
- Published
- 1984-01
- Volume
- 20
- Issue
- 1-2
- Pages
- 97-118
- ISSN
- 0020-0271 (ISSN-L)
- 0306-4573
- OpenAlex
- W1972454041
- Cited by
- 102
- References
- 1
- FWCI
- 7.76
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Problem solving techniques for the design of algorithms. https://app.cochat.ai/papers/10.1016/0306-4573(84)90042-6
- The paper
- Kant, E., & Newell, A. (1984). Problem solving techniques for the design of algorithms. Information Processing & Management. https://doi.org/10.1016/0306-4573(84)90042-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.