Search Sciweavers | Sciweavers

429 search results - page 13 / 86

» Turing computations on ordinals

click to vote

CORR
1999
Springer

65views Education» more CORR 1999»

Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

14 years 11 months ago

Download ccc.cs.uni-duesseldorf.de

It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...

Lane A. Hemaspaandra, Jörg Rothe

claim paper

Read More »

Voted

COCO
1989
Springer

64views Algorithms» more COCO 1989»

Turing Machines with few Accepting Computations and low Sets for PP

15 years 3 months ago

Download edoc.hu-berlin.de

Johannes Köbler, Uwe Schöning, Seinosuke...

claim paper

Read More »

click to vote

AMC
2006

58views more AMC 2006»

Relativistic computers and the Turing barrier

14 years 11 months ago

Download www.math-inst.hu

István Németi, Gyula Dávid

claim paper

Read More »

click to vote

CORR
2002
Springer

90views Education» more CORR 2002»

Hypercomputation: computing more than the Turing machine

14 years 11 months ago

Download www.hypercomputation.net

Toby Ord

claim paper

Read More »

click to vote

COGSCI
1998

53views more COGSCI 1998»

Turing's Analysis of Computation and Theories of Cognitive Architecture

14 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers