371 search results - page 25 / 75 » Partition Theorems and Computability Theory |
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
AMAI
2007
Springer
14 years 9 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
– This paper describes a new algorithm for the efficient mass-matrix inversion of serial manipulators. Whereas several well-known O(n) algorithms already exist, our presentation ...
101
click to vote
CADE
1990
Springer
15 years 1 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...