Sciweavers

2086 search results - page 74 / 418
» Mathematical Theory Exploration
Sort
View
AMC
2006
82views more  AMC 2006»
13 years 9 months ago
Some thoughts on hypercomputation
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
Newton C. A. da Costa, Francisco A. Doria
EATCS
2002
46views more  EATCS 2002»
13 years 9 months ago
Understanding the Mulmuley-Sohoni Approach to P vs. NP
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
Kenneth W. Regan
CADE
2004
Springer
14 years 10 months ago
Formalizing Undefinedness Arising in Calculus
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
William M. Farmer
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
14 years 3 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget