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
1936 introductions
정지 문제

🌐한국어

English Deutsch Español Français Italiano Nederlands Polski Português Svenska Tiếng Việt Türkçe Русский العربية فارسی हिन्दी ไทย 한국어 中文日本語

EntityQ622849· pop 35· linked from 472 articles

정지 문제

컴퓨터 이론에서 프로그램의 정지 여부를 판별하는 문제

Available in 35 languages

Español
Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
हिन्दी

Connections

computability theory

semantic theory of truth

Categories

1936 introductions Computability theory Mathematical problems Theory of computation Undecidable problems

Sources

wikipedia.externallinksexternallink

Show 16 more

Greek
Hebrew
Lombard
Nederlands
Polski
Serbian
simple
Slovak
Svenska
Tiếng Việt
Türkçe
Ukrainian
zh_yue
فارسی
ไทย
한국어

via Wikidata sitelinks · CC0

mathematical logic

Entity

Gödel's incompleteness theorems

first-order logic

axiomatic system

Gregory Chaitin

partial function

primitive recursive function

Chaitin's constant

semantics of logic

recursively enumerable set

Sign in to save

Similar entities

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

Entitydist 0.47

Entitydist 0.53

Cesano Boscone railway halt

Entitydist 0.54

Rocchetta Cairo railway halt

Entitydist 0.55

Entitydist 0.56

Entitydist 0.56

Entitydist 0.57

Poço Barreto halt

Entitydist 0.60

do–while loop

Entitydist 0.62

Entitydist 0.63

Entitydist 0.64

C Programming/Control

Entitydist 0.64

What links here472 pages

mathematical expression

distributed computing

lambda calculus

elementary equivalence

continuum hypothesis

Cantor's paradox

three-valued logic

compactness theorem

circular reference

algebra of sets

computer-assisted proof

superseded scientific theory

Kleene's recursion theorem

Chaitin's constant