Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

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

decider · Vinony

EntityQ2518389· pop 9· linked from 94 articles

decider

Sign in to save

Turing machine that always halts for any input

Connections

regular language

partial function

Dennis M. Ritchie

Gödel's incompleteness theorems

formal language

finite-state machine

automata theory

computability theory

Chomsky hierarchy

first-order logic

halting problem

esoteric programming language

Categories

Sources

wikipedia.externallinksexternallink

What links here94 pages

Chomsky hierarchy

recursive language

deterministic finite automata

nondeterministic finite automaton

pushdown automaton

context-sensitive grammar

probabilistic Turing machine

context-sensitive language

Büchi automaton

generative grammar

regular expression

Turing completeness

regular language

deterministic context-free grammar

primitive recursive function

Alternating Turing machine

finite-state machine

universal Turing machine

non-deterministic Turing machine

Kuroda normal form

Indexed grammar

computable function

formal language

Similar entities

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

halting problem

Entitydist 0.47

Cesano Boscone railway halt

Entitydist 0.61

Entitydist 0.61

decision problem

Entitydist 0.62

Entitydist 0.63

Rocchetta Cairo railway halt

Entitydist 0.64

Poço Barreto halt

Entitydist 0.66

Entitydist 0.69

Entitydist 0.69

switch statement

Entitydist 0.69

one-instruction set computer

Entitydist 0.71

EFF DES cracker

Entitydist 0.71