Sciweavers

551 search results - page 49 / 111
» Natural proofs
Sort
View
CCA
2009
Springer
14 years 3 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
AUIC
2004
IEEE
14 years 14 days ago
Wearable Microphone Array as User Interface
We are at present enabled with machine-empowered technologies. The future is certainly looking towards human-empowered technologies, which should enable mobile user with natural w...
Yong Xu, Mingjiang Yang, Yanxin Yan, Jianfeng Chen
CIE
2005
Springer
14 years 2 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
SIGCSE
1997
ACM
112views Education» more  SIGCSE 1997»
14 years 28 days ago
Introducing fixed-point iteration early in a compiler course
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
Max Hailperin
ECOOP
2009
Springer
14 years 9 months ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio