Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

کاهش‌پذیری تورینگ · Vinony

Home
Alan Turing
کاهش‌پذیری تورینگ

🌐فارسی

English Deutsch Italiano Polski Português Русский فارسی 中文日本語

EntityQ4489310· pop 10· linked from 63 articles

کاهش‌پذیری تورینگ

concept in computability theory

Available in 10 languages

中文
日本語
Русский
Português
Italiano
Catalan
Czech
Polski
فارسی

via Wikidata sitelinks · CC0

Connections

polynomial-time reduction

Categories

Alan Turing Reduction (complexity)

Sources

wikipedia.externallinksexternallink

Alan Turing

Entity

International Standard Book Number

digital object identifier

computability theory

computational complexity theory

indicator function

Church–Turing thesis

halting problem

Stephen Cole Kleene

Turing completeness

Sign in to save

What links here63 pages

arithmetical hierarchy

computability theory

Turing completeness

complexity class

The chemical basis of morphogenesis

computable function

Computing Machinery and Intelligence

Log-space reduction

combinatorial optimization

halting problem

PSPACE-complete

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

computability theory

Entitydist 0.26

Turing completeness

Entitydist 0.37

Entitydist 0.38

Entitydist 0.40

minimalism (computing)

Entitydist 0.46

Entitydist 0.46

Entitydist 0.48

Entitydist 0.48

Entitydist 0.49

computational hardness assumption

Entitydist 0.49

Entitydist 0.49

Category:Computability theory

Entitydist 0.49