MSCS 2006 | Sciweavers

10

MSCS
2006

53views more MSCS 2006»

13 years 4 months ago

Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...

Andrew E. M. Lewis, George Barmpalias

claim paper

Read More »

9

click to vote

MSCS
2006

73views more MSCS 2006»

Continuous semantics for strong normalisation

13 years 4 months ago

Download www.cs.swan.ac.uk

Ulrich Berger

claim paper

Read More »

6

click to vote

MSCS
2006

62views more MSCS 2006»

Compactly generated domain theory

13 years 4 months ago

Download homepages.inf.ed.ac.uk

Ingo Battenfeld, Matthias Schröder, Alex Simp...

claim paper

Read More »

12

click to vote

MSCS
2006

87views more MSCS 2006»

Addressed term rewriting systems: application to a typed object calculus

13 years 4 months ago

Download web.cs.wpi.edu

Daniel J. Dougherty, Pierre Lescanne, Luigi Liquor...

claim paper

Read More »

6

click to vote

MSCS
2006

58views more MSCS 2006»

Ordinal computations

13 years 4 months ago

Download www.math.uic.edu

Peter Koepke, Martin Koerwien

claim paper

Read More »

5

click to vote

MSCS
2006

54views more MSCS 2006»

Quasi-metric spaces and point-free geometry

13 years 4 months ago

Download www.dmi.unisa.it

nded abstract of a paper published on Math. Struct. in Comp. Science, 16 (2006) 115-137) Anna Di Concilio and Giangiacomo Gerla Dipartimento di Matematica e Informatica, Via Ponte...

Anna Di Concilio, Giangiacomo Gerla

claim paper

Read More »

4

click to vote

MSCS
2006

50views more MSCS 2006»

Monoids over domains

13 years 4 months ago

Download www.entcs.org

Michael W. Mislove

claim paper

Read More »

16

click to vote

MSCS
2006

69views more MSCS 2006»

Restricted jump interpolation in the d.c.e. degrees

13 years 4 months ago

Download www.math.uiuc.edu

It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...

Carl G. Jockusch Jr., Angsheng Li

claim paper

Read More »

4

click to vote

MSCS
2006

49views more MSCS 2006»

On light logics, uniform encodings and polynomial time

13 years 4 months ago

Download www-lipn.univ-paris13.fr

Ugo Dal Lago, Patrick Baillot

claim paper