3 ms·
> Haskell beginners often use lists instead of arrays. You can’t do random access in a linked list, but only access the first element and then the rest of the l
by tromp 3y ago
> Haskell beginners often use lists instead of arrays. You can’t do random access in a linked list, but only access the first element and then the rest of the list. The real world also doesn’t allow you random access, you are limited by the speed of light and have to go from one location to the next.
You don't need arrays for random access though. Haskell trees give you access to 2^n leaves within depth n, which also exceeds physical limitations like the speed of light.
- fatfingerd 3y agoBut Quantum entanglement seems to be traveling in God's channel, how does that happen if God is using linked lists?
- gnull 3y agoWhat does it have to do with the speed of light?
- deleted 3y ago[deleted]
- rowanG077 3y agoThis for sure doesn't violate speed of light. I can also access >>>>>2^n locations within n time in the real world.
- tromp 3y agoIn 3-dimensional space you can only access O(n^3) locations in n steps (where a step corresponds to the distance between adjacent locations).
- rowanG077 3y agoYou can access infinite locations. Nothing stops you from moving diagonally in an arbitrary angle, move forward and then backwards. I'd hoped my extravagant uses of > made that clear. Reality is practically continuous not discrete.