On Computable Numbers with An Application to the AlanTuringproblem

Catrin Huws; James Finnis

doi:10.1007/s10506-017-9200-2

On Computable Numbers with An Application to the AlanTuringproblem

Catrin Huws, James Finnis

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid

1 Dyfyniad (Scopus)

265 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 wreiddiol	Saesneg
Tudalennau (o-i)	181-203
Nifer y tudalennau	23
Cyfnodolyn	Artificial Intelligence and Law
Cyfrol	25
Rhif cyhoeddi	2
Dyddiad ar-lein cynnar	13 Mai 2017
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1007/s10506-017-9200-2
Statws	Cyhoeddwyd - 01 Meh 2017

NDC y CU

Mae’r allbwn hwn yn cyfrannu at y Nod(au) Datblygu Cynaliadwy canlynol

Mynediad at Ddogfen

10.1007/s10506-017-9200-2Trwydded: CC BY

On computable numbers with an application to the AlanTuringproblemFersiwn derfynol wedi’i chyhoeddi, 461 KBTrwydded: CC BY

Cysylltiad parhaol

Dolen barhaus

Ffeiliau eraill a chysylltiadau

Dolen i’r cyhoeddiad yn Scopus

Catrin Fflur Huws
- trhaber.acuk
- Ysgol y Gyfraith Aberystwyth - Senior Lecturer
Unigolyn: Dysgu ac Ymchwil

Dyfynnu hyn

@article{10039697e8ef4991b6db56927fc00ce7,

title = "On Computable Numbers with An Application to the AlanTuringproblem",

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 {\textquoteleft}On computable numbers with an application to the Entscheidungsproblem.{\textquoteright} Drawing upon the legal, social, and political context of Alan Turing{\textquoteright}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{\textquoteright}s computability thesis within the context of legal decision-making",

keywords = "Criminal law, Decision making, Homosexuality, Legal certainty, Machine learning, Statutory interpretation",

author = "Catrin Huws and James Finnis",

note = "Publisher Copyright: {\textcopyright} 2017, The Author(s).",

year = "2017",

month = jun,

day = "1",

doi = "10.1007/s10506-017-9200-2",

language = "English",

volume = "25",

pages = "181--203",

journal = "Artificial Intelligence and Law",

issn = "0924-8463",

publisher = "Springer Nature",

number = "2",

}

TY - JOUR

T1 - On Computable Numbers with An Application to the AlanTuringproblem

AU - Huws, Catrin

AU - Finnis, James

PY - 2017/6/1

Y1 - 2017/6/1

N2 - 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

AB - 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

KW - Criminal law

KW - Decision making

KW - Homosexuality

KW - Legal certainty

KW - Machine learning

KW - Statutory interpretation

UR - http://www.scopus.com/inward/record.url?scp=85019194771&partnerID=8YFLogxK

U2 - 10.1007/s10506-017-9200-2

DO - 10.1007/s10506-017-9200-2

M3 - Article

SN - 0924-8463

VL - 25

SP - 181

EP - 203

JO - Artificial Intelligence and Law

JF - Artificial Intelligence and Law

IS - 2

ER -

On Computable Numbers with An Application to the AlanTuringproblem

Crynodeb

NDC y CU

Mynediad at Ddogfen

Cysylltiad parhaol

Ffeiliau eraill a chysylltiadau

Ôl bys

Proffiliau

Catrin Fflur Huws

Dyfynnu hyn