Skip to main content
Article thumbnail
Location of Repository

Sock Sorting Laxmi Parida (IBM and NYU), Rohit Parikh (CUNY and NYU)

By Vaughan Pratt (stanford

Abstract

Algorithms of a social nature are extremely important and we are very dependent on certain “data structures ” like names and social security numbers, on courts and on the postal system, and on various other social structures which enable us to perform activities like calling someone (you need her name for that), suing someone, or sending someone a bill. Unlike the situation in the theory of computation the existence of an algorithm for a real life situation always implies that the problem is feasibly solvable. Perhaps the closest to the unsolvability of the halting problem are Arrow’s [1] impossibility theorems for voting. In this paper we analyze a rather mundane problem the problem of sorting socks after they have come out of the dryer and give severa

Topics: Contents
Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.178.4654
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.liacs.nl/%7Emarcell... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.