Cost Function

The cost a postive integer m for m > 1 is defined as the minimum of C_S(a)+C_S(b) such that a and b are positive integers and m = a * b for a binary operation * ∈ S. Regardless of S, C_S(1) = 1. This function is similar to Komgorov complixities, however it is computable.

Contents of Repository

This repository contains a collection of files used for calculating the cost of an integer as well as tables of their costs.