The problem of researching a recursive society: Algorithms, data coils and the looping of the social

This commentary article outlines and explores the key problem that faces anyone interested in researching and understanding what might be thought of as a recursive society. It reflects on the problem that is posed by the layering of multiple feedback loops as a result of algorithmic sorting and data...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Big data & society Jg. 9; H. 2
1. Verfasser: Beer, David
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London, England SAGE Publications 01.07.2022
Sage Publications Ltd
SAGE Publishing
Schlagworte:
Algorithms
Coiling
Data
Feedback
Feedback loops
Loops
Recursion
Recursive algorithms
Sorting algorithms
Algorithms
feedback loops
data coils
recursive society
researching algorithms
recursivity
ISSN:2053-9517, 2053-9517
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This commentary article outlines and explores the key problem that faces anyone interested in researching and understanding what might be thought of as a recursive society. It reflects on the problem that is posed by the layering of multiple feedback loops as a result of algorithmic sorting and data processes. This article is concerned with the difficulties of understanding the social where recursive algorithmic processes have repeatedly shaped outcomes, practices, relations and actions over time. This is not just about the sinking of algorithms into the everyday, it is about the way that loop-upon-loop of data processes lead to the social world itself being recursive. This repeated looping is described here as a kind of data coiling. The article argues for a focus on recursivity and for an engagement with the conceptual problems and questions that this notion implies.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2053-9517
2053-9517
DOI:10.1177/20539517221104997