Book contents
- The Age of Algorithms
- The Age of Algorithms
- Copyright page
- Contents
- Acknowledgments
- 1 Algorithms Intrigue, Algorithms Disturb
- 2 What Is an Algorithm?
- 3 Algorithms, Computers, and Programs
- 4 What Algorithms Do
- 5 What Algorithms Don’t Do
- 6 Computational Thinking
- 7 The End of Employment
- 8 The End of Work
- 9 The End of Property
- 10 Governing in the Age of Algorithms
- 11 An Algorithm in the Community
- 12 The Responsibility of Algorithms
- 13 Personal Data and Privacy
- 14 Fairness, Transparency, and Diversity
- 15 Computer Science and Ecology
- 16 Computer Science Education
- 17 The Augmented Human
- 18 Can an Algorithm Be Intelligent?
- 19 Can an Algorithm Have Feelings?
- 20 Time to Choose
7 - The End of Employment
Published online by Cambridge University Press: 17 March 2020
Book contents
- The Age of Algorithms
- The Age of Algorithms
- Copyright page
- Contents
- Acknowledgments
- 1 Algorithms Intrigue, Algorithms Disturb
- 2 What Is an Algorithm?
- 3 Algorithms, Computers, and Programs
- 4 What Algorithms Do
- 5 What Algorithms Don’t Do
- 6 Computational Thinking
- 7 The End of Employment
- 8 The End of Work
- 9 The End of Property
- 10 Governing in the Age of Algorithms
- 11 An Algorithm in the Community
- 12 The Responsibility of Algorithms
- 13 Personal Data and Privacy
- 14 Fairness, Transparency, and Diversity
- 15 Computer Science and Ecology
- 16 Computer Science Education
- 17 The Augmented Human
- 18 Can an Algorithm Be Intelligent?
- 19 Can an Algorithm Have Feelings?
- 20 Time to Choose
Summary
In 2002, during a performance/installation, 35 Hours of Work, Benjamin Sabatier sharpened pencils seven hours a day for five days. Sharpening pencils in this way for thirty-five hours is a deviant act, because custom dictates that we use a pencil sharpener for a few seconds, to sharpen a pencil, after which we put it away in a drawer until we need it again. As a consequence, a pencil sharpener is used only a few minutes per year.
- Type
- Chapter
- Information
- The Age of Algorithms , pp. 53 - 60Publisher: Cambridge University PressPrint publication year: 2020