:PROPERTIES: :ID: 43dd8110-2e8e-42a3-8d7a-55da895da68a :mtime: 20231009024102 :ctime: 20231009023649 :END: #+title: Asymptotic Complexity of Computable Function #+filetags: :public:project: * Definition Some measure of the "cost" of a program as the input to the program grows * Category-Theoretic Definition [[id:7ca1ba5c-b67f-462d-b099-cf36390ef062][Conal Elliott]] has a category-theoretic defintion, which you can see at https://github.com/conal/simple-parallel/blob/main/Parallel.agda * Big O Notation Computer scientists may use big O notation See [[id:b52fee3e-988c-4ca9-ab9e-e9f036e7e525][Big O Notation]]