Abstract
We show that unlike the general case of the relationship between algorithmic probability and program-size for enumerating sets, in the case of the graphs of total functions these two quantities are closely related.
You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026
Select search scope: search across all journals or within the current journal
We show that unlike the general case of the relationship between algorithmic probability and program-size for enumerating sets, in the case of the graphs of total functions these two quantities are closely related.