Computational problem

A formally specified relation between encoded instances and acceptable solutions sought by an algorithm.

Version

v2 · 2026-09-19 · History

Domain-specific #

3819

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomain

Theoretical Computer Science → Computer Science & Software Engineering

Core Idea

A computational problem assigns each valid finite input representation a set of permitted outputs, with decision, search, counting, function, optimization, and promise forms distinguished by output and domain structure.^[1] An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of theoretical computer science. It is the domain-specific identity determined by the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

Rules for Right Answers

A computational problem is a question with rules about which answers count as right. For example: 'Give me two numbers that add up to 10.' Lots of answers work, like 3 and 7, or 5 and 5. The problem is just the list of what's allowed — not the way you figure it out.

The Question Before the Program

A computational problem describes what a computer is supposed to do: for every possible input, it says which outputs count as correct. For example, "given a list, put it in order" is a problem, and any correctly sorted list is a right answer. The problem is not the same as the program that solves it; many different programs can solve the same problem. Some problems ask yes-or-no questions, some ask you to find something, some ask you to count, and some ask for the best choice.

Inputs Paired With Correct Outputs

A Computational problem assigns to each valid input, written in some finite form, a set of allowed outputs. The instances, the rule for which outputs are acceptable, how inputs are represented, and what counts as success are all fixed before any particular algorithm is chosen. Problems come in forms: decision problems (yes/no), search problems (find a solution), counting problems, function problems, optimization problems, and promise problems (where only certain inputs need to be handled). An algorithm is a way of producing correct outputs under some model of computation, and complexity measures how many resources that takes as input size grows. Keeping the problem separate from the algorithm is what lets us compare different solutions to the same problem.

 

A computational problem is a relation assigning to each valid finite input representation a set of permitted outputs. Its forms — decision, search, counting, function, optimization, and promise — are distinguished by the structure of the output and of the input domain. An algorithm realizes a solution mapping for the problem within a model of computation, and computational complexity measures the resources that mapping requires as input size grows. The problem's identity is fixed by four components specified independently of any particular algorithm: the instance set, the admissible-solution relation, the input representation, and the success condition. Because representation is part of the definition, the same abstract question encoded differently can have different complexity. Recognizing a computational problem means checking that these components are explicit; a piece of code, a benchmark, or an informal task description is not yet a problem in this sense.

Structural Signature

• Carrier: the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets
• Inputs or antecedent state: the exact theoretical computer science carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Computational problem
• Constitutive operation: An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows.
• Invariant: the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm
• Recognition test: type the carrier, state every parameter and convention in the definition, test that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
• Output or consequence: recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
• Failure boundary: the carrier is mistyped, the condition that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not

• It is not the whole field of theoretical computer science. The field contains many questions and methods that do not instantiate Computational problem.
• It is not its most familiar example. A canonical instance directly demonstrates that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
• It is not the neighboring catalog concept Algorithm. An algorithm is a procedure that solves or approximates a problem; the computational problem is the input-output specification against which procedures are judged.
• It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Computational problem must control the decision
• It is not an unrestricted metaphor for any process that seems similar. Outside theoretical computer science, the vocabulary and validity conditions do not transfer literally.

Scope of Application

Computational problem belongs to theoretical computer science and is useful where the analyst can specify the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, then evaluate the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. The scope is broad within that domain but bounded by the need for the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

• Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
• Construction or evolution. Track how the exact theoretical computer science carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Computational problem are converted, constrained, or organized by An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows..
• Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
• Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Computational problem must control the decision and state which convention or theorem controls the decision.
• Downstream reasoning. Use the established identity to support recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity

The abstraction clarifies a crowded vocabulary by making the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Computational problem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact theoretical computer science carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Computational problem, the structure counts as Computational problem exactly when the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Computational problem. Computational problem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Computational problem. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
3. Derive consequences. From the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm, infer recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
4. Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Computational problem must control the decision and an object that resembles Computational problem in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
5. Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer

Knowledge transfers strongly among subfields of theoretical computer science because they reuse the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows., and type the carrier, state every parameter and convention in the definition, test that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Computational problem, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples

Canonical

A canonical instance directly demonstrates that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm. The example exposes the carrier and directly tests that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets; the operative rule is An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows.; the invariant is the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm; and the result supports recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm destroys the classification.

Mapped back: the typed theoretical computer science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets → An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows. → the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm → recognizing and comparing instances of Computational problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions

• T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
• T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
• T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
• T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
• T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
• T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Computational problem, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Computational problem, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from theoretical computer science and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent

The structural core consists of a carrier, An algorithm realizes a solution mapping under a model of computation, while complexity measures the resources needed as input size grows., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Computational problem, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Computational problem, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in theoretical computer science.

Instantiates / Related Primes

This entry is a kind of Function (Mapping).

It remains its own entry because the instance set, the admissible-solution relation, the representation, and the success condition are fixed explicitly and independently of any particular algorithm.

Relationships to Other Abstractions

Current abstraction Computational problem Domain-specific

Parents (1) — outgoing typed relations

• Computational problem is a kind of Function (Mapping) Prime

  What makes it its own entry: the domain-specific identity determined by the instance set, admissible-solution relation, representation, and success condition are explicitly fixed independently of any particular algorithm.

Children (18) — abstractions linked here by typed relations

• 3SUM Domain-specific is a kind of Computational problem

  3SUM is a strict kind of Computational Problem: each finite input asks whether a three-element zero-sum witness exists.

• Co-RE-complete Domain-specific is a kind of Computational problem

  Co-RE-complete denotes a decision problem complete for co-RE, not the complexity class itself.

• Dynamic Problem Domain-specific is a kind of Computational problem

  Dynamic Problem is a domain-specific kind of computational problem under the frozen identity and differentia. Complete-catalog comparison found the corresponding live broader identity.

▸ Show 15 more

Hierarchy path (1) — routes to 1 parentless root

• Computational problem → is a kind of Function (Mapping)

Neighborhood in Abstraction Space

Computational problem sits in a crowded region of the domain-specific corpus (5^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Computational Complexity Classes & Hierarchies (30 abstractions)

Nearest neighbors

• State space (computer science) — 0.95
• Constructible function — 0.92
• Empirical algorithmics — 0.92
• SC (complexity) — 0.92
• Computable real function — 0.92

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With

• Algorithm. An algorithm is a procedure that solves or approximates a problem; the computational problem is the input-output specification against which procedures are judged.
• One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
• Measurement or implementation of Computational problem. A proxy or realization is evidence for the abstraction, not the abstraction itself.
• Generalized Computational problem. An extension qualifies only when its changed axioms and retained invariant are stated.

References

[1] Shimon Even, Alan L Selman, Yacov Yacobi, 'The complexity of promise problems with applications to public-key cryptography', Information and Control, 1984, doi:10.1016/S0019-9958(84)80056-X. registry ↩a ↩b

[2] Oded Goldreich, 'Computational Complexity: A Conceptual Perspective', Cambridge University Press, 2008. registry ↩a ↩b

[3] Oded Goldreich, Avi Wigderson, 'The Princeton Companion to Mathematics', Princeton University Press, 2008.not authoritative registry ↩