Sciweavers

4401 search results - page 375 / 881
» Computing with Default Logic
Sort
View
CCA
2009
Springer
16 years 1 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
FDL
2004
IEEE
15 years 10 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
16 years 3 months ago
The Compositional Far Side of Image Computation
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Chao Wang, Gary D. Hachtel, Fabio Somenzi
DIGRA
2003
Springer
15 years 12 months ago
Exploration in computer games - a new starting point
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Simon Egenfeldt-Nielsen
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 6 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka