# Hernán Eche

less info
reputation
7
bio website location Rosario, Argentina age member for 2 years, 9 months seen Feb 26 at 13:20 profile views 39

Natural numbers = Everything

# 59 Actions

 Feb21 accepted Consistent but incomplete formal axiomatic systems Feb21 comment How to change from base $n$ to $m$ I would like to know more about the distinction between "representations that mix", and that "don't mix" (or 'bleed' as you said) "i.e. blocks of digits can be considered without worrying about their neighbors", this reminds me prefix codes that can be decoded while reading, I see that if the conversion is made between power-relate-bases "block of digits" can be converted, but between non-related-to-power-bases the conversion seems to get complex, I wish this distinction would have a name, (better than bleed), it deserves one! Feb21 comment How to change from base $n$ to $m$ +1 for a different answer, great that you pointing out about m=n^k, it's hard for me to 'translate'your notation into code, but I will google for Horner form. Do you know any paper or related material on this kind of conversion? (I've asked a question about this fact here cs.stackexchange.com/questions/21736/…) May14 awarded Caucus May10 accepted Clues to prove average in T is minor or equal than average in a smaller inner interval. May10 comment Clues to prove average in T is minor or equal than average in a smaller inner interval. @user69810 added "or disprove", the thing is how to elaborate this kind of problems May10 comment Clues to prove average in T is minor or equal than average in a smaller inner interval. @WimC good comment, thanks, fixed (I think) May10 revised Clues to prove average in T is minor or equal than average in a smaller inner interval. added 1 characters in body May10 asked Clues to prove average in T is minor or equal than average in a smaller inner interval. Mar14 accepted Bounded recursive sequence Mar14 comment Bounded recursive sequence Yes is a recurrence relation, I didn't knew about $2a_n=3a_{n-1}-2a_{n-2}$, I would have thought that it was a periodic function, is amazing, thanks Mar13 asked Bounded recursive sequence May4 comment Consistent but incomplete formal axiomatic systems It's known for languages or machines to clasify for being "Turing complete" or not, if those are turing complete then they allow to do the question about the halting problem, and the answer is no, on the other hand there are complete examples like Chess game, it don't allow you to do an undecidable question, well, I wonder if there are any example between those. thanks May4 asked Consistent but incomplete formal axiomatic systems Jan19 accepted The minimal cardinal set from a choice between a set and its complement Jan19 revised The minimal cardinal set from a choice between a set and its complement add a comment for background information Jan19 comment The minimal cardinal set from a choice between a set and its complement +1 Good for highlight the comparable cardinals restriction and the relative complement notation, there is still a detail to solve, in your L(A) bracket I think it would remains to specify that it could be $L(A) = A$ even when $| X\setminus A |$ = $| A |$, but that's not specified. Perhaps that "detail" make things being complex because there is not any criterion of choice, or perhaps I could simply add $L=A \vee L= X\setminus A$ when $| X\setminus A |$ = $| A |$, but I doubt that it keep being "well defined", then an arbitrary choice of L(A)=A in the definition could be enough Jan19 comment The minimal cardinal set from a choice between a set and its complement @ArturoMagidin that's a tip for freedom, thanks Jan19 revised The minimal cardinal set from a choice between a set and its complement added 53 characters in body Jan19 comment The minimal cardinal set from a choice between a set and its complement @Jay thanks for the comment, I've added it