On Sat, Feb 9, 2013 at 12:41 AM, meekerdb <[email protected]> wrote:
> On 2/8/2013 2:14 PM, Telmo Menezes wrote: > > > My point is that the only possible write algorithm that doesn't read > information that is already stored is one that starts writing at random in > any position. You could erase or corrupt previous information and you have > no index. > > > I don't see why that should be the case. The write can be to an allocated > memory area that maintains a pointer. > And then you have to read the pointer before writing. It could be in the disk, or in memory, or in the cache, or in a processor register. Doesn't matter, there's a piece of information you have to access. One read operation buys you sequential writing. The more complex the data structure, the more reads you will find. I believe the brain contains a very complex data structure. > > Brent > > -- > You received this message because you are subscribed to the Google Groups > "Everything List" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > Visit this group at http://groups.google.com/group/everything-list?hl=en. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
