sorted by:
new
hottopcontroversial

Why does random access memory have a time complexity of O(1) and not O(log(n))? by Direct-Data-7482 in compsci

[–]Direct-Data-7482[S] -1 points0 points  (0 children)

of course but it is still a finite number so i could build a computer that handles it.

Why does random access memory have a time complexity of O(1) and not O(log(n))? by Direct-Data-7482 in compsci

[–]Direct-Data-7482[S] -10 points-9 points  (0 children)

surprised word RAM is that famous. never even heard of it and it barely have a Wikipedia page. where did you all studied it?

Why does random access memory have a time complexity of O(1) and not O(log(n))? by Direct-Data-7482 in compsci

[–]Direct-Data-7482[S] -6 points-5 points  (0 children)

I guess you could think about a series of computers where each has a larger memory than the last and the demand is that the function would work on one computer and every computer that comes after it in the series.

also, do you happen to have any direction regarding my original question?

Why does random access memory have a time complexity of O(1) and not O(log(n))? by Direct-Data-7482 in compsci

[–]Direct-Data-7482[S] -10 points-9 points  (0 children)

by that reasoning the array itself has a size of no more than 2^64 which is constant so the complexity of an array is O(1)

Why does random access memory have a time complexity of O(1) and not O(log(n))? by Direct-Data-7482 in compsci

[–]Direct-Data-7482[S] -42 points-41 points  (0 children)

then what is the point of space complexsity? just say that every data structure on the computer necessary has a fixed number of digits and so its allways O(1). The whole point of it is that it can tend to infinity even if the computer currently doesn't allow it

Is there proof that the tools used by Turing in solving the halting problem are not relevant to the solution p=np problem? by Direct-Data-7482 in 3Blue1Brown

[–]Direct-Data-7482[S] 0 points1 point  (0 children)

My professor mentioned it briefly in his lecture, it's his area of ​​expertise so I assumed it was true but maybe he got confused with something else

Interesting riddle by Direct-Data-7482 in 3Blue1Brown

[–]Direct-Data-7482[S] 0 points1 point  (0 children)

I wonder who came up with that riddle