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 ...
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 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.
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 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 ...
Woodward J (2010) Program Induction, Complexity and Occam's Razor: The Induction of Computable Functions, Modularity and No Free Lunch Theorems. Saarbrucken, Germany ...
We have a serious problem with how we have been teaching computability theory, a central component of the ACM/IEEE computer science curriculum. Let me explain. For a fair number of years, I taught a ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback