2010/07/27 by Rade Vuckovac, Vuckovac, Rade
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1007.4660
9 pages, 8 figures draft only
arxiv created 2010/07/27 · openalex publication_date 2010/07/27 · arxiv updated 2010/07/28 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
This paper argues an existence of a class of functions where function own input makes function description. That fact have impact to the wide spectrum of phenomena such as negative findings of Random Oracle Model in cryptography, complexity in some rules of cellular automata (Wolfram rule 30) and determinism in the true randomness to name just a few.