José Félix Costa
According to our database1, José Félix Costa authored at least 62 papers between 1991 and 2017.
Legend:Book In proceedings Article PhD thesis Other
Computations with oracles that measure vanishing quantities.
Mathematical Structures in Computer Science, 2017
Unity of Science as Seen Through the Universal Computer.
The Power of Analogue-Digital Machines - (Extended Abstract).
Proceedings of the Unconventional Computation and Natural Computation, 2017
Uncertainty in Time.
Parallel Processing Letters, 2015
Three Forms of Physical Measurement and their Computability.
Rew. Symb. Logic, 2014
A Natural Computation Model of Positive Relativisation.
An analogue-Digital Church-Turing Thesis.
Int. J. Found. Comput. Sci., 2014
The ARNN model relativises P=NP and P!=NP.
Theor. Comput. Sci., 2013
Incomputability at the foundations of physics (A study in the philosophy of science).
J. Log. Comput., 2013
Oracles that measure thresholds: the Turing machine and the broken balance.
J. Log. Comput., 2013
Processes with infinite liveness requirements.
J. Log. Algebr. Program., 2013
On the Power of Threshold Measurements as Oracles.
Proceedings of the Unconventional Computation and Natural Computation, 2013
Unifying Science Through Computation: Reflections on Computability and Physics.
Proceedings of the Special Sciences and the Unity of Science, 2012
The impact of models of a physical oracle on computational power.
Mathematical Structures in Computer Science, 2012
Preface to the Special Issue on Physics and Computation "Towards a Computational Interpretation of Physical Theories".
Applied Mathematics and Computation, 2012
Natural Computing, 2011
Preface to the Special Issue Unconventional Computing 2008.
Natural Computing, 2010
Limits to measurement in experiments governed by algorithms.
Mathematical Structures in Computer Science, 2010
Computable Scientists, Uncomputable World - (Abstract).
Proceedings of the Unconventional Computation - 9th International Conference, 2010
Natural Computing, 2009
Processes with local and global liveness requirements.
J. Log. Algebr. Program., 2009
Five Views of Hypercomputation.
Physical Experiments as Oracles.
Bulletin of the EATCS, 2009
Limits to measurement in experiments governed by algorithms
A foundation for real recursive function theory.
Ann. Pure Appl. Logic, 2009
Applied Mathematics and Computation, 2009
The Euclid Abstract Machine.
Oracles and Advice as Measurements.
Proceedings of the Unconventional Computing, 7th International Conference, 2008
On the Complexity of Measurement in Classical Physics.
Proceedings of the Theory and Applications of Models of Computation, 2008
A new conceptual framework for analog computation.
Theor. Comput. Sci., 2007
Computability on reals, infinite limits and differential equations.
Applied Mathematics and Computation, 2007
The Abstract Immune System Algorithm.
Proceedings of the Unconventional Computation, 6th International Conference, 2007
The New Promise of Analog Computation.
Proceedings of the Computation and Logic in the Real World, 2007
The P ne NP conjecture in the context of real and complex analysis.
J. Complexity, 2006
Undecidability over Continuous Time.
Logic Journal of the IGPL, 2006
Introduction to the special issue on hypercomputation.
Applied Mathematics and Computation, 2006
The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem.
Proceedings of the Unconventional Computation, 5th International Conference, 2006
What Lies Beyond the Mountains?
Bulletin of the EATCS, 2005
Real recursive functions and their hierarchy.
J. Complexity, 2004
The Computational Power of Continuous Dynamic Systems.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
Analog computers and recursive functions over the reals.
J. Complexity, 2003
Symbolic Processing in Neural Networks.
J. Braz. Comp. Soc., 2003
An Analog Characterization of the Grzegorczyk Hierarchy.
J. Complexity, 2002
Canonical Institutions of Behaviour.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2001
Verifying Properties of Neural Networks.
Proceedings of the Connectionist Models of Neurons, 2001
Iteration, Inequalities, and Differentiability in Analog Computers.
J. Complexity, 2000
Nonsequential Automata Semantics for a Concurrent, Object-Based Language.
Electr. Notes Theor. Comput. Sci., 1998
Lower Bounds of Computational Power of a Synaptic Calculus.
Proceedings of the Biological and Artificial Computation: From Neuroscience to Technology, 1997
Turing Universality of Neural Nets (Revisited).
Proceedings of the Computer Aided Systems Theory, 1997
Mirror, Mirror in my Hand: A Duality between Specifications and Models of Process Behaviour.
Mathematical Structures in Computer Science, 1996
Synchronization in Petri Nets.
Fundam. Inform., 1996
Object Specification Logic.
J. Log. Comput., 1995
Progress Assumption in Concurrent Systems.
Formal Asp. Comput., 1995
Refinement Mapping for General (Discrete Event) Systems Theory.
Proceedings of the Computer Aided Systems Theory, 1995
Object Inheritance Beyond Subtyping.
Acta Inf., 1994
Process Semantics for Resolution.
Proceedings of the ICPL 1994 Workshop W1: Process-Based Parallel Logic Programming, 1994
Institutions for Behaviour Specification.
Proceedings of the Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30, 1994
Data Encapsulation and Modularity: Three Views of Inheritance.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
An Institution of Object Behaviour.
Proceedings of the Recent Trends in Data Type Specification, 1992
Process Semantics of Temporal Logic Specifications.
Proceedings of the Recent Trends in Data Type Specification, 1991