Abstract: We investigate interrelationships among different notions from mathematical analysis, effective topology, and classical computability theory. Our main object of study is the class of ...

Abstract: Previous results state that there is no single universal search algorithm which outperforms other algorithms in terms of search on functions over finite domains. We consider functions with ...

Woodward J (2009) Computable and incomputable functions and search algorithms. In: Proceedings - 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2009, volume ...

The study of computable algebraic structures lies at the intersection of algebra, computer science and complexity theory. At its core, this field investigates how abstract algebraic systems can be ...

The theorem of Royer and Case states that there exists a limit-computable function β_1:N→N which eventually dominates every computable function δ_1:N→N. We present an alternative proof of this theorem ...

The Cinderella scripts were used to generate the images in the paper. They are self-explanatory. The basis pursuit code that I have adapted is from S. Boyd, N. Parikh, E. Chu, B. Peleato, and J.

What is a mathematical proof? It can be described as a sequence of logical steps and calculations that serve as evidence of the correctness of a statement. The steps must follow rules that are ...