Xoff
Reputation
6,880
Top tag
Next privilege 10,000 Rep.
Access moderator tools
 1d comment Common traits of functions which are non-trivial to integrate? you probably mean $n>1$. And you're not asking about non integrability, but about impossibility to express the integral with usual functions. Maybe you can modify the title ? Apr22 answered Do you need true randomness to beat the two-envelope game? Apr11 comment Find all prime triples $(a,b,c)$ such $a+1,b+1,c+1$ form a geometric sequence @RoryDaulton I may have fixed the problem. But 39 cases it's not a few. Apr11 revised Find all prime triples $(a,b,c)$ such $a+1,b+1,c+1$ form a geometric sequence added 264 characters in body Apr11 answered Find all prime triples $(a,b,c)$ such $a+1,b+1,c+1$ form a geometric sequence Apr7 revised If $a,b,c\in\mathbb{R^+}$ such that $abc = 1$ and $ab + bc + ca = 5$. Prove that $17/4 \leq (a+b+c)\leq 1+ \sqrt{32}.$ edited body Mar27 answered strongly hh-immune sets Mar25 answered Convert NFA to DFA Mar24 comment Set of One-Variable Computable Function and one Local Contest Questions? @LoveComplexity With usual definitions, $(a)$ is false and $(d)$ is right. However with no proper definitions of all the terms of the question, it may be debatable. Mar24 comment Set of One-Variable Computable Function and one Local Contest Questions? @LoveComplexity because usually, an instruction is a basic operator, and it's bounded and atomic, it's not a whole expression with unbounded length. Even if you can write a universal program with $n$ instructions doesn't mean you obtain all computable functions : simulation is not the same as having all functions directly ! (In a very dramatic case, you could take a singleton set containing only a universal function, this set is of course not the same as the set of all computable functions) Mar24 comment Set of One-Variable Computable Function and one Local Contest Questions? @LoveComplexity you're right ! But usually we count $X\leftarrow m$ as $n+1$ instructions where $n$ is the number of operations needed to define $m$, that's why I prefer answer $(d)$ to $(a)$. But I think you understand well the question. Mar24 comment Set of One-Variable Computable Function and one Local Contest Questions? @LoveComplexity As I say to my students, if you don't understand something, you should ask a question about what you don't understand. If you only say "I don't understand", it doesn't help me to know what I can say, and I suspect you didn't do any effort to understand what I explained. So what precisely is your question about my explanation ? :) Mar24 comment Set of One-Variable Computable Function and one Local Contest Questions? @LoveComplexity All answers are obviously disjoint : only one can true. Mar24 answered Set of One-Variable Computable Function and one Local Contest Questions? Mar23 revised Turing reducibility and Set of All Turing Degrees added 12 characters in body Mar23 comment Turing reducibility and Set of All Turing Degrees @CarlMummert I mean there is an uncountable number of Turing degrees. Just edited now Mar23 comment Turing reducibility and Set of All Turing Degrees @CarlMummert I agree with you : each degree is a set of subsets of $\mathbb N$. I did not write that a subset is a degree but is in a degree. Mar22 answered Polynomial ring with integral coefficients is integral Mar22 comment Creative and Simple Set and $S \leq_m C$? @AliMovagher Ok $S^c$ is the complement of $S$. By definition, $S^c$ does not contain any r.e infinite subset. Hence, he can't have any simple or creative subset (because both are infinite and r.e). Mar22 comment Solve this system of equation @EnthusiasticStudent I just gave the name $\alpha$ to $\frac{x}{y}$. I can do that because $y\neq 0$.