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 ...

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.

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 ...

Woodward J (2010) Program Induction, Complexity and Occam's Razor: The Induction of Computable Functions, Modularity and No Free Lunch Theorems. Saarbrucken, Germany ...

Computability : computable functions, logic, and the foundations of mathematics by Epstein, Richard L Publication date 1989 Topics Computable functions, Logic, Symbolic and mathematical Publisher ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

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 ...

Abstract: The construction of non-computable functions used in this paper is based on the principle that a finite, non-empty set of non-negative integers has a largest element. Also, this principle is ...

Classical probability theory gives all sequences of fair coin tosses of the same length the same probability. On the other hand, when considering sequences such as Computational theory can be used to ...

Why do you need this library? Google Chrome (as of version 64) can not estimate the total download size of XMLHTTPRequests when content-encoding: gzip is set, even if the content-length header is set.