2020/02/19 by Rade Vuckovac, Vuckovac, Rade
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms
paper · pdf · doi:10.48550/arxiv.2003.05269
openalex publication_date 2020/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.