371 search results - page 21 / 75 » Partition Theorems and Computability Theory |
204
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
170
click to vote
JCT
2010
15 years 4 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
151
click to vote
MKM
2007
Springer
16 years 3 days ago
2007
Springer
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
126
click to vote
STACS
2009
Springer
16 years 23 days ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
164
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...