371 search results - page 5 / 75 » Partition Theorems and Computability Theory |
SIGCSE
1999
ACM
15 years 1 months ago
1999
ACM
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
116
click to vote
CCA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
AISC
1998
Springer
15 years 1 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
ENTCS
2008
14 years 9 months ago
2008
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...