Hmm so it could create some apps with my help to fastly create apps. Cause really the idea of teaching it our coding styles seemed a very adhd creating idea. Let it be a noncollobrative coder that creates not ever to maintain product but who needs maintenance when it could regenerate from its internal crystallized structures by then. Hmm. The idea of teaching it our coding methods (in patterns wise or make it a perfect python or c coder) seemed very adhd creating idea to me I felt adhd to even if that stage hadn't came yet. So let it be not a collobration oriented ai and code the entire project on its own type of status I would design as after coming to that stage. Ok even the idea of making ai a perfect coder in golang or python or rust or cpp felt severely adhd creating sttn to me. Ok definitely won't be a collaboration oriented coder then.
ok then the continuation of Goldbach proof: second part logic were wrong (in second blog of goldbach conjecture proof) that if there is none prime from C1 equivalence class, that means number should be like: 2n / 2 = n and 2n being always less than n! makes this such number be improbable. unless number is less than value that enables C1 at most 1 more element than 1 element set, then in such case still then Goldbach conjecture wouold be true e.g. 2*3 in that case. and any more than 1 element in C1 equivalence class results of problem being considered for the solution part where there are more than 1 elements in C1 equivalence class. So Goldbach conjecture is true for every number is the conclusion yep.
Yorumlar
Yorum Gönder