@Article{Yanofsky2006,
author = {Yanofsky, Noson S}, 
title = {Towards a Definition of an Algorithm}, 
journal = {arXiv}, 
volume = {math.LO}, 
number = {}, 
pages = {}, 
year = {2006}, 
abstract = {We define an algorithm to be the set of programs that implement or express that algorithm. The set of all programs is partitioned into equivalence classes. Two programs are equivalent if they are “essentially” the same program. The set of equivalence classes forms the category of algorithms. Although the set of programs does not even form a category, the set of algorithms form a category with extra structure. The conditions that tell when two programs are essentially the same turn out to be coherence relations that give the category of algorithms the extra structure. Universal properties of the category of algorithms are given.}, 
location = {}, 
keywords = {math.CT; math.LO}}

{"_id":"GQucfPDxDpqcfrAwx","bibbaseid":"yanofsky-towardsadefinitionofanalgorithm-2006","authorIDs":[],"author_short":["Yanofsky, N. S"],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Yanofsky"],"firstnames":["Noson","S"],"suffixes":[]}],"title":"Towards a Definition of an Algorithm","journal":"arXiv","volume":"math.LO","number":"","pages":"","year":"2006","abstract":"We define an algorithm to be the set of programs that implement or express that algorithm. The set of all programs is partitioned into equivalence classes. Two programs are equivalent if they are “essentially” the same program. The set of equivalence classes forms the category of algorithms. Although the set of programs does not even form a category, the set of algorithms form a category with extra structure. The conditions that tell when two programs are essentially the same turn out to be coherence relations that give the category of algorithms the extra structure. Universal properties of the category of algorithms are given.","location":"","keywords":"math.CT; math.LO","bibtex":"@Article{Yanofsky2006,\nauthor = {Yanofsky, Noson S}, \ntitle = {Towards a Definition of an Algorithm}, \njournal = {arXiv}, \nvolume = {math.LO}, \nnumber = {}, \npages = {}, \nyear = {2006}, \nabstract = {We define an algorithm to be the set of programs that implement or express that algorithm. The set of all programs is partitioned into equivalence classes. Two programs are equivalent if they are “essentially” the same program. The set of equivalence classes forms the category of algorithms. Although the set of programs does not even form a category, the set of algorithms form a category with extra structure. The conditions that tell when two programs are essentially the same turn out to be coherence relations that give the category of algorithms the extra structure. Universal properties of the category of algorithms are given.}, \nlocation = {}, \nkeywords = {math.CT; math.LO}}\n\n\n","author_short":["Yanofsky, N. S"],"key":"Yanofsky2006","id":"Yanofsky2006","bibbaseid":"yanofsky-towardsadefinitionofanalgorithm-2006","role":"author","urls":{},"keyword":["math.CT; math.LO"],"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.607Z","downloads":0,"keywords":["math.ct; math.lo"],"search_terms":["towards","definition","algorithm","yanofsky"],"title":"Towards a Definition of an Algorithm","year":2006,"dataSources":["hEoKh4ygEAWbAZ5iy"]}