Codex Wiki
OurBigBook.com
Site
Source code
Many-one reduction
Home
Mathematics
Area of mathematics
Foundations of mathematics
Computability theory
OurBigBook.com
Words: 77
Articles: 3
A many-one reduction
A
≤
m
B
is a total computable
f
satisfying
x
∈
A
exactly when
f
(
x
)
∈
B
.
Table of contents
77
3
Many-one degree
Many-one reduction
14
Computable reduction by staged enumeration
Many-one reduction
23
Many-one complete set
Many-one reduction
23
Ancestors
(5)
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(5)
Solution
Solution
Solution
Solution
Solution