MSCS 2010 | Sciweavers

ABSTRACT. In this note we prove that any Turing machine which uses only a ﬁnite computational space for every input cannot solve an uncomputable problem even in case it runs in a...

Cristian S. Calude, Ludwig Staiger

claim paper

Read More »

22

click to vote

MSCS
2010

70views more MSCS 2010»

A separation between divergence and Holevo information for ensembles

13 years 9 months ago

Download www.math.uwaterloo.ca

Rahul Jain, Ashwin Nayak, Yi Su

claim paper

Read More »

25

click to vote

MSCS
2010

44views more MSCS 2010»

Turing universality of the Biochemical Ground Form

13 years 9 months ago

Download lucacardelli.name

Luca Cardelli, Gianluigi Zavattaro

claim paper

Read More »

28

click to vote

MSCS
2010

74views more MSCS 2010»

Selection functions, bar recursion and backward induction

13 years 9 months ago

Download www.cs.bham.ac.uk

Martín Hötzel Escardó, Paulo Ol...

claim paper

Read More »

31

click to vote

MSCS
2010

65views more MSCS 2010»

Domain representations of spaces of compact subsets

13 years 9 months ago

Download www.cs.swan.ac.uk

Ulrich Berger, Jens Blanck, Petter Kristian K&osla...

claim paper

Read More »

38

click to vote

MSCS
2010

84views more MSCS 2010»

Channel abstractions for network security

13 years 9 months ago

Download www.dsi.unive.it

Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...

Michele Bugliesi, Riccardo Focardi

claim paper

Read More »

23

click to vote

MSCS
2010

59views more MSCS 2010»

Tree-functors, determinacy and bisimulations

13 years 9 months ago