Recursive Functions
Exercises: Computability, etc.
Introduction to Computer Science - ppt download
Computer Science - Summary - CS Summary Computer science is the study of algorithms on formal, - Studeersnel
The Symbol Grounding Problem - ppt download
An Introduction to Computer Science - ppt download
Turing Uncomputability - by Jørgen Veisdal - Privatdozent
1 CHAPTER 1 Fundamental Tools 2 Definition of an algorithm (from CS10051): An algorithm is a well-ordered collection of unambiguous and effectively computable. - ppt download
Chapter 1 Further Topics in Computable Analysis
6 Arithmetic, computability, and incompleteness
Computability and Complexity
Notation: f: S -> T means f is a function with domain | Chegg.com
Computable number - Wikipedia
Computability Dr. Colin Campbell Course Element 2 (EMAT20531) - ppt download
Towards Computability over Effectively Enumerable Topological Spaces – topic of research paper in Mathematics. Download scholarly article PDF and read for free on CyberLeninka open science hub.
number theory - How to compute an "effectively computable constant" in a formula of approximation of powers of $2$ and $3$ - Mathematics Stack Exchange
Computability Dr. Colin Campbell Course Element 2 (EMAT20531) - ppt download
Efficiently Computable Complex Multiplication of Elliptic Curves | springerprofessional.de
An efficiently computable metric for comparing polygonal shapes | Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some results related to the continuity problem
h-Monotonically Computable Real Numbers
ON SOME RECENT CRITICISM OF CHURCH'S THESIS* ELLIOTT MENDELSON A function f(x1,...,xn) is said to be effectively computable if t
PDF) A case for weakening the Church-Turing Thesis | Bhupinder Singh Anand - Academia.edu
Effectively Computable Ordinal Functions
PDF) An Interpretation of the Church-Turing Thesis | Mihai Ganea - Academia.edu
Séminaire de théorie des nombres Some Effectively Computable Applications of GRH
arXiv:1308.1324v4 [math.LO] 3 Mar 2014
