On Function Description
Computational Complexity
2020-03-12 v1
Abstract
The main result is that: function descriptions are not made equal, and they can be categorised in at least two categories using various computational methods for function evaluation. The result affects Kolmogorov complexity and Random Oracle Model notions. More precisely, the idea that the size of an object and the size of the smallest computer program defining that object is a ratio that represents the object complexity needs additional definitions to hold its original assertions.
Keywords
Cite
@article{arxiv.2003.05269,
title = {On Function Description},
author = {Rade Vuckovac},
journal= {arXiv preprint arXiv:2003.05269},
year = {2020}
}
Comments
16 pages, 5 figures