On Function Description

02/19/2020
by   Rade Vuckovac, et al.
0

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.

READ FULL TEXT
research
07/10/2019

On the Complexity of Completing Binary Predicates

Given a binary predicate P, the length of the smallest program that comp...
research
03/24/2020

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms

We study the multi-item mechanism design problem where a monopolist sell...
research
07/15/2021

Lossy Kernelization of Same-Size Clustering

In this work, we study the k-median clustering problem with an additiona...
research
08/01/2023

Absolute continuity, supports and idempotent splitting in categorical probability

Markov categories have recently turned out to be a powerful high-level f...
research
11/04/2022

Certification with an NP Oracle

In the certification problem, the algorithm is given a function f with c...
research
08/08/2002

Linking Makinson and Kraus-Lehmann-Magidor preferential entailments

About ten years ago, various notions of preferential entailment have bee...
research
08/07/2020

Optimizing Program Size Using Multi-result Supercompilation

Supercompilation is a powerful program transformation technique with num...

Please sign up or login with your details

Forgot password? Click here to reset