Sciweavers

429 search results - page 45 / 86
» Turing computations on ordinals
Sort
View
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
15 years 2 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
FSTTCS
1992
Springer
15 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
AMC
2006
117views more  AMC 2006»
14 years 9 months ago
The case for hypercomputation
The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspecte...
Mike Stannett
FUIN
2006
63views more  FUIN 2006»
14 years 9 months ago
Interpreted Trajectories
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...
CORR
2002
Springer
67views Education» more  CORR 2002»
14 years 9 months ago
The prospects for mathematical logic in the twenty-first century
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
Samuel R. Buss, Alexander S. Kechris, Anand Pillay...