arXiv:math/0602053math.LO
Towards a Definition of an Algorithm
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
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 we give that describe when two programs are essentially the same turn out to be coherence relations that enrich the category of algorithms with extra structure. Universal properties of the category of algorithms are proved.
> Ontology of programs The presuppositions of programs or to program Example: https://arxiv.org/pdf/math/0602053v3.pdf > The epistemological status of computer science Do Neural Nets learn or memorize? What's the difference and how do we know what Neural Nets do? Example…
fabianhjrView on HNParent context