2 ms·
Every problem i can break into a sub problem is solveable. Thus proofen by induction that i can break recursively down every problem, i deduce- that i crashed w
by SticksAndBreaks 10y ago
Every problem i can break into a sub problem is solveable.
Thus proofen by induction that i can break recursively down every problem, i deduce- that i crashed with a NN-Stackoverflow.
- thomasahle 10y ago> Every problem i can break into a sub problem is solveable. Given the sub problems are either solvable or can in turn be broken down, I suppose?