On Computable Numbers with An Application to the AlanTuringproblem

Research output: Contribution to journalArticlepeer-review

1 Citation (SciVal)
248 Downloads (Pure)

Abstract

This paper explores the question of whether or not the law is a computable number in the sense described by Alan Turing in his 1937 paper ‘On computable numbers with an application to the Entscheidungsproblem.’ Drawing upon the legal, social, and political context of Alan Turing’s own involvement with the law following his arrest in 1952 for the criminal offence of gross indecency, the article explores the parameters of computability within the law and analyses the applicability of Turing’s computability thesis within the context of legal decision-making
Original languageEnglish
Pages (from-to)181-203
Number of pages23
JournalArtificial Intelligence and Law
Volume25
Issue number2
Early online date13 May 2017
DOIs
Publication statusPublished - 01 Jun 2017

Keywords

  • Criminal law
  • Decision making
  • Homosexuality
  • Legal certainty
  • Machine learning
  • Statutory interpretation

Fingerprint

Dive into the research topics of 'On Computable Numbers with An Application to the AlanTuringproblem'. Together they form a unique fingerprint.

Cite this