Sciweavers

1888 search results - page 26 / 378
» Proof theory and computational analysis
Sort
View
SYNTHESE
2010
87views more  SYNTHESE 2010»
13 years 5 months ago
Proofs, pictures, and Euclid
Though pictures are often used to present mathematical arguments, they are not typically thought to be an acceptable means for presenting mathematical arguments rigorously. With re...
John Mumma
CADE
2003
Springer
14 years 7 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 7 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 7 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
HICSS
2003
IEEE
130views Biometrics» more  HICSS 2003»
14 years 19 days ago
Politeness Theory and Computer-Mediated Communication: A Sociolinguistic Approach to Analyzing Relational Messages
This conceptual paper suggests how Politeness Theory [6] – well known in anthropological and linguistic literatures – can contribute to the study of role relations in computer...
David A. Morand, Rosalie J. Ocker