On Computable Numbers with An Application to the AlanTuringproblem

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

1 Dyfyniadau(SciVal)
250 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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
Iaith wreiddiolSaesneg
Tudalennau (o-i)181-203
Nifer y tudalennau23
CyfnodolynArtificial Intelligence and Law
Cyfrol25
Rhif cyhoeddi2
Dyddiad ar-lein cynnar13 Mai 2017
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 01 Meh 2017

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'On Computable Numbers with An Application to the AlanTuringproblem'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn