Unibo AI
Search
Ctrl
+
K
Unibo AI
Search
Ctrl
+
K
complexity
Asymptotic Notation
Binary encoding
Computability and Complexity
Part 1
polynomials
Courses
Part 2
Reduction
Rice Theorem
Semantic languages
Trivial languages
Turing machine
Uncomputability
Enter your search text in the box above
Select a result to preview
polynomials
Any sentence of the form:
a
X
k
+
b
X
k
−
1
+
c
X
k
−
2
+
.
.
.
+
z
X
0
Powered by Forestry.md