Re:'We Like Lists Because We Don't Want to Die'
by c1sc0 on Monday November 16, 2009 @08:01AM
(#944357)
And once you understand that lists can be nested things become really interesting
[ Parent
| on HN ]
Re:'We Like Lists Because We Don't Want to Die'
by DannoHung on Monday November 16, 2009 @01:53PM
(#945001)
Things get more interestinger once you realize that it's all just degenerative cases of bidirectional cyclic graphs.
Re:'We Like Lists Because We Don't Want to Die'
by gloob on Monday November 16, 2009 @08:45PM
(#945794)
The tough part is finding a tidy syntax for representing said bidirectional cyclic graphs.
A programming language with support for arbitrary graph literals would make me happy.
Re:'We Like Lists Because We Don't Want to Die'
by tayssir on Tuesday November 17, 2009 @06:55AM
(#946261)
If I understand correctly, that's just like Common Lisp's way to specify cyclic references.
http://www.lispworks.com/documentation/HyperSpec/Body/02_dhp...
Re:'We Like Lists Because We Don't Want to Die'
by xinsight on Monday November 16, 2009 @12:10PM
(#944750)
Even with nested lists, I'm still not clear why this is such a powerful concept.
How do lists help us to think?
Re:'We Like Lists Because We Don't Want to Die'
by nazgulnarsil on Monday November 16, 2009 @12:39PM
(#944830)
before you have a solid ontological understanding of a concept, lacking powerful descriptive axioms we're forced to rely on a list of characteristics e.g. intrinsic properties, how it interacts with other objects, etc. if we restrict ourselves to things we already have a vigorous understanding of how will we consider new hypothesis?
I'm not sure if this is coming through right.
Re:'We Like Lists Because We Don't Want to Die'
by phr on Monday November 16, 2009 @03:46PM
(#945258)
Reminds me of interfaces in Google Go. No rigid class hierarchy to cram our objects into. Just implement a list of methods and you're good.
Re:'We Like Lists Because We Don't Want to Die'
by anigbrowl on Monday November 16, 2009 @05:21PM
(#945444)
by establishing the concept of scope and discriminatory criteria for inclusion or exclusion. Look up 'bongard problems' and appreciate that while some are based around topological or temporal progression, others require cataloging random arrangements and establishing membership criteria.