All Questions

The undecidability of Hilbert's tenth problem implies the following (there is a stronger statement here, Theorem 9): For any computable function $f$, there is a family of integer polynomials (where ...

Roughly speaking,Kolmogorov Complexity of a bits string or a description is the minimal length of programs outputing a bits string,and height of rational number is logarithm of the largest numerator ...

Given a partially computable function, is there an analytic complex function which is equal to it at every point of it's domain? Or under what condition does a partially computable function correspond ...

Let $f(x)=ax^2+bx+c$ and $f(x)=n$. Is there an algorithm to choose $a,b,c$ such that the discriminant is minimized? Where $a,b,c,n,x$ are all integers. More concretely, is there an algorithm to find $...