Sciweavers

2333 search results - page 134 / 467
» Recursive Computational Depth
Sort
View
AML
2008
66views more  AML 2008»
13 years 9 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
BSL
2008
98views more  BSL 2008»
13 years 9 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
CSDA
2006
71views more  CSDA 2006»
13 years 9 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
FOSSACS
2004
Springer
14 years 3 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 9 months ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...