The following pages link to Costa, José Félix (Q162056):
Displaying 46 items.
- (Q383787) (redirect page) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- Physical oracles: the Turing machine and the Wheatstone bridge (Q609645) (← links)
- Real recursive functions and their hierarchy (Q706790) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- (Q1323342) (redirect page) (← links)
- Object inheritance beyond subtyping (Q1323343) (← links)
- Analog computers and recursive functions over the reals. (Q1426051) (← links)
- Progress assumption in concurrent systems (Q1805398) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- The power of analogue-digital machines (extended abstract) (Q2400941) (← links)
- The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
- Machines that perform measurements (Q2672643) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- AN ANALOGUE-DIGITAL CHURCH-TURING THESIS (Q2929623) (← links)
- Axiomatizing physical experiments as oracles to algorithms (Q2941593) (← links)
- Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
- Undecidability over Continuous Time (Q3424115) (← links)
- On the Complexity of Measurement in Classical Physics (Q3502630) (← links)
- Oracles and Advice as Measurements (Q3543332) (← links)
- Computational complexity with experiments as oracles. II. Upper bounds (Q3561915) (← links)
- The Abstract Immune System Algorithm (Q3603411) (← links)
- (Q4314310) (← links)
- Computations with oracles that measure vanishing quantities (Q4593234) (← links)
- Uncertainty in Time (Q4598899) (← links)
- (Q4600392) (← links)
- A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (Q4686644) (← links)
- Mirror, mirror in my hand: a duality between specifications and models of process behaviour (Q4715670) (← links)
- Object Specification Logic (Q4849647) (← links)
- (Q4874646) (← links)
- (Q4942098) (← links)
- Object interaction (Q5096831) (← links)
- THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (Q5176163) (← links)
- On the Power of Threshold Measurements as Oracles (Q5300906) (← links)
- Oracles that measure thresholds: the Turing machine and the broken balance (Q5406112) (← links)
- Incomputability at the foundations of physics (A study in the philosophy of science) (Q5406115) (← links)
- The New Promise of Analog Computation (Q5425320) (← links)
- The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem (Q5429222) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)
- Machines, Computations, and Universality (Q5710875) (← links)
- Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
- The Power of Machines That Control Experiments (Q6114859) (← links)
