Main Question or Discussion Point
Can you write an example where a space complexity of any number-theoretic algorithm is calculated? Thanks In Advance.
Yes.nworm said:Thank you.
If I understand rightly then you mean "the uniform cost criterion" and "the logarithmic cost criterion" from
Sort of close but not completely. Our computers are known to simulate Turing Machines. As i said earlier, the unit cost RAM model is far more powerful than our Turing Machine. That is, a unit cost RAM model can outperform our computers at certain things and obviously, since we are looking at things that our computers are capable of doing, we wouldnt want to work with unit cost RAM model.I deal with big numbers. So I think to use the logarithmic cost criterion, i.e. O(log N) units of space for a number N (or O(log N) bits for a number N). Am I right?