About functions where function input describes inner working of the function
Rade Vuckovac

TL;DR
This paper explores a class of functions where the input defines the function's behavior, impacting various phenomena like cryptographic models, cellular automata complexity, and randomness.
Contribution
It introduces the concept of functions whose input describes their inner workings, offering new insights into their role across multiple computational phenomena.
Findings
Implications for the Random Oracle Model in cryptography
Insights into cellular automata complexity
Understanding of determinism in true randomness
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · semigroups and automata theory
