= 27d567bc2d48d9f40e9ccc20ea370b15)
Clarity comments on Open Thread, Jun. 1 - Jun. 7, 2015 - Less Wrong Discussion
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (203)
Suppose we have a set S of n elements, and we ask people to memorize sequences of these elements, and we find that people can generally easily memorize sequences of length k (for some definition of "generally" and "easily"). If we then define a function f(S) := k log n, how will f depend on S? Have there been studies on this issue?
Sorry, this was an useless post so now it's gone
k and n are implicitly functions of S. So f(S) = (length of a memorizable sequence of elements of S) * (cardinality of S).