Ordering: Human versus Computer
Binary comparison operators form the basis of consumer set theory. When finding the preferred item from a set, humans frequently use a binary comparison operator. If humans could only perform binary comparisons, however, then any procedure a human might employ to make a complete preference ordering of n items would be bound from below in both cost and time by O(n log2, n). Experimental evidence indicates that humans are capable of implementing a linear algorithm for small sets. This indicates that humans have an ordinal utility function.
KeywordsSorting Algorithm Information Operator Linear Algorithm Prefer Item Binary Comparison
- 1.Aho, A.V., J.E. Hoperoft, and J.D. Ullman, 1974, The Design and Analysis of Computer Algorithms, Reading: Addison-Wesley.Google Scholar
- 2.Knuth, Donald E., 1973, The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition, Reading: Addison-Wesley.Google Scholar
- 3.Gujarati, Damodar N., 1995, Basic Econometrics, Third Edition, New York: McGraw-Hill.Google Scholar
- 5.Simon, H.A., 1976, `From substantive to procedural rationality’, in S. Latsis (Ed.), Method and Appraisal in Economics, Cambridge: Cambrdige University Press.Google Scholar
- 6.Traub, J., G. Wasilkowski, and H. Wozniakowski, 1988, Information Based Complexity, Boston: Academic Press.Google Scholar