The Everyday Life of an Algorithm (Daniel Neyland)

 
0.0 (0)
The Everyday Life of an Algorithm (Daniel Neyland)

An algorithm is a set of IF...THEN rules are used to create a new, moral video surveillance architecture for transportation hubs.

This open-access book starts with an algorithm. The algorithm will be followed by readers for three years as they chart its daily activities.

The algorithm must understand ethical, transparent, accountable, and market value issues through a sequence of increasingly difficult types of experimentation. If the algorithm is to become a standard component of the settings where it is being used, it must demonstrate its capacity to grasp daily life at this point.

The book begins a conversation with existing social science research that frequently focuses on the strength and opacity of algorithms by examining the algorithm's day-to-day activities. We have exclusive access to the design, development, and testing of the algorithm in this book, but we can also attest to its brittleness and reliance on others.

Ebook Details

About the Authors
Professor of Sociology Daniel Neyland teaches at Goldsmiths University in London, United Kingdom. In the context of science, technology, and organizational structures, his research examines questions of governance, responsibility, and ethics. He has written works on topics like organizational ethnography, banal governance, and privacy and surveillance.
Published
Published Date / Year
1st ed. (January 3, 2019); eBook (Creative Commons Licensed)
License(s)
CC BY 4.0
Hardcover
160 pages
eBook Format
PDF (154 pages) and ePub
Language
English
ISBN-10
3030005771
ISBN-13
978-3030005771

Similar Programming & Computer Books

Éléments d'algorithmique - Algorithmic elements (D. Beauquier, et al)
This free programming book differs from other treatises on algorithms in two ways: first, we give special attention to the new tree structures that have emerged recently (bicolor trees,...
Complexité algorithmique - Algorithmic complexity (Sylvain Perifel)
The foundational ideas of algorithmic complexity theory are first covered in this free programming book before moving on to a number of more sophisticated subjects. ...
Algorithmique du texte - Text Algorithms (Maxime Crochemore, et al)
This free programming book offers a broad overview of text-processing algorithms. As such, it is an algorithmic book, but one whose goal is to utilize computers to manipulate language....
Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design (S. I. Khmelnik)
This free programming book describes many iterations of processors made for affine transformations of planar and spatial many-dimensional figures. This processor is designed to perform affine transformations on geometrical...
Parallel Complexity Theory (Sanjeev Arora, et al.)
The focus of this free programming book is the research of Parallel Computing and Programming, which serves as an abstract indicator of the complexity of parallel computing problems. ...
Computational Complexity: A Conceptual Perspective (Oded Goldreich)
The study of the innate complexity of computer jobs is introduced conceptually in this free programming book. It is meant to be used as a textbook or for independent...
Computational Complexity (Wikibooks)
All computer science grads should read this free programming book since it offers information that is fundamental to their understanding of computation theory. ...
Learning Processing: A Beginner's Guide to Programming Images, Animation, and Interaction (Daniel Shiffman)
This free programming book shows you how to use Processing to build the fundamental programming building blocks required to develop cutting-edge graphics applications, such as interactive art, live video...
The Complexity of Boolean Functions (Ingo Wegener)
One of the most fascinating and crucial areas of theoretical computer science presently includes research on the difficulty of Boolean functions in non-uniform processing models. It directly relates to...
Applied Combinatorics on Words (M. Lothaire)
This volume's goal is to provide a comprehensive analysis of some of the main areas in which combinatorics is applied. Core algorithms for text processing, natural language processing, audio...

User reviews

There are no user reviews for this listing.
Ratings
Rate this Book
Comments