#### Filter Results:

- Full text PDF available (52)

#### Publication Year

1991

2017

- This year (4)
- Last 5 years (19)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Daniel Silva Graça, José Félix Costa
- J. Complexity
- 2003

In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative… (More)

- Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
- J. Complexity
- 2002

- Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa
- J. Complexity
- 2000

Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPAC-computable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such that F (x; t) = f (x) for non-negative integers t. We show that G… (More)

- Amílcar Sernadas, Cristina Sernadas, José Félix Costa
- J. Log. Comput.
- 1995

We discuss combining physical experiments with machine computations and introduce a form of analogue-digital Turing machine. We examine in detail a case study where an experimental procedure based on Newtonian kinematics is combined with a class of Turing machines. Three forms of analogue-digital machine are studied, in which physical parameters can be set… (More)

- Jerzy Mycka, José Félix Costa
- J. Complexity
- 2004

In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been 9 considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, 11 Lecture Notes in Computer Science, Vol. 2509, Springer,… (More)

In this paper we will try to understand how oracles and advice functions, which are mathematical abstractions in the theory of computability and complexity, can be seen as physical measurements in Classical Physics. First, we consider how physical measurements are a natural external source of information to an algorithmic computation. We argue that oracles… (More)

- José Félix Costa, Bruno Loff, Jerzy Mycka
- Ann. Pure Appl. Logic
- 2009

The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital… (More)

- José Luiz Fiadeiro, José Félix Costa
- Mathematical Structures in Computer Science
- 1996

- José Félix Costa, Amílcar Sernadas, Cristina Sernadas
- Acta Informatica
- 1994

A categorial semantic domain for objects is presented in order to clarify both aggregation and specialization. Three kinds of specialization are discussed: (1) subtyping (specialization with no side effects and no non-monotonic overriding); (2) monotonic specialization (possibly with side effects but still only with monotonic overriding); and (3)… (More)