Graph centered on Computable function, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Computable function

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A partial function computed by some Turing machine; a total computable function halts on every input in its domain type.

Record metadata

Carrier(s)

Data

Canonically induces

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

AlgorithmComputable function

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

A terminating or partial algorithm determines a partial function. The assertion that every effective algorithm is captured by Turing computability is the Church–Turing thesis, not a formal theorem.

How to interpret this relation type

Reinterpret an object, pass to an equivalent presentation, or relate canonically corresponding structures; the carrier may change.

Relation sources

  • Turing — On Computable Numbers — On Computable Numbers, with an Application to the Entscheidungsproblem · original research paper · source ID turing-computable-numbers

Turing machineComputable function

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Each deterministic Turing machine induces a partial function by its input-output behavior; machines that halt on every input compute total functions.

How to interpret this relation type

Apply a standard functorial or canonical construction whose output is not merely a reduct of the input and is not generally an equivalent presentation of the same object.

Relation sources

  • Turing — On Computable Numbers — On Computable Numbers, with an Application to the Entscheidungsproblem · original research paper · source ID turing-computable-numbers

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

Computable functionMany-one reduction

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

The reduction is the computable map ff whose membership-preservation equivalence transfers decidability and many undecidability arguments from the target problem to the source problem.

How to interpret this relation type

A mathematical concept supplies part of the formal language, state space, representation, or analytic machinery used by a scientific or mathematical-physics concept. The source is the mathematical predecessor; this does not claim that physical content follows from mathematics alone.

Relation sources