André Curtis-Trudel
Dados Biográficos
| ID | 1053415 |
|---|---|
| NOME | André Curtis-Trudel |
| PRENOMES | André |
| SOBRENOME | Curtis-Trudel |
| ASSINATURA | CURTIS-TRUDEL A |
| AFILIAÇÕES | Lingnan University |
| ORCID | 0000-0002-2008-6134 |
| VERIFICADO | Sim |
| TOTAL DE OBRAS | 7 |
| TOTAL DE CITAÇÕES | 1 |
| OBRAS COMO AUTOR | 7 |
| OBRAS COMO EDITOR | 0 |
| PRIMEIRO ANO DE PUBLICAÇÃO | 2021 |
| ANO MAIS RECENTE DE PUBLICAÇÃO | 2025 |
| ÍNDICE H | 1 |
Computation in Context
Unlimited pancomputationalism is the claim that every physical system implements every computational model simultaneously. Some philosophers argue that unlimited pancomputationalism renders implementation ‘trivial’ or ‘vacuous’, unsuitable for serious scientific work. A popular and natural reaction to this argument is to reject unlimited pancomputationalism. However, I argue that given certain assumptions about the nature of computational ascript…
Does the no miracles argument apply to AI
According to the standard no miracles argument, science’s predictive success is best explained by the approximate truth of its theories. In contemporary science, however, machine learning systems, such as AlphaFold2, are also remarkably predictively successful. Thus, we might ask what best explains such successes. Might these AIs accurately represent critical aspects of their targets in the world? And if so, does a variant of the no miracles argu…
Limitative computational explanations
Mathematical Explanation in Computer Science
This note scouts a broad but underexplored class of explanations found in contemporary computer science. These explanations, which I call limitative explanations, explain why certain problems cannot be solved computationally. Limitative explanations are philosophically rich, but have not received the attention they deserve. The primary goals of this note are to isolate limitative explanations and provide a preliminary account of what makes them e…
The determinacy of computation
Why Do We Need a Theory of Implementation
The received view of computation is methodologically bifurcated: it offers different accounts of computation in the mathematical and physical cases. But little in the way of argument has been given for this approach. This article rectifies the situation by arguing that the alternative, a unified account, is untenable. Furthermore, once these issues are brought into sharper relief we can see that work remains to be done to illuminate the relations…
Implementation as Resemblance
This article advertises a new account of computational implementation. According to the resemblance account, implementation is a matter of resembling a computational architecture. The resemblance account departs from previous theories by denying that computational architectures are exhausted by their formal, mathematical features. Instead, they are taken to be permeated with causality, spatiotemporality, and other nonmathematical features. I argu…
Implementation as Resemblance
This article advertises a new account of computational implementation. According to the resemblance account, implementation is a matter of resembling a computational architecture. The resemblance account departs from previous theories by denying that computational architectures are exhausted by their formal, mathematical features. Instead, they are taken to be permeated with causality, spatiotemporality, and other nonmathematical features. I argu…
The determinacy of computation
Why Do We Need a Theory of Implementation
The received view of computation is methodologically bifurcated: it offers different accounts of computation in the mathematical and physical cases. But little in the way of argument has been given for this approach. This article rectifies the situation by arguing that the alternative, a unified account, is untenable. Furthermore, once these issues are brought into sharper relief we can see that work remains to be done to illuminate the relations…
Limitative computational explanations
Mathematical Explanation in Computer Science
This note scouts a broad but underexplored class of explanations found in contemporary computer science. These explanations, which I call limitative explanations, explain why certain problems cannot be solved computationally. Limitative explanations are philosophically rich, but have not received the attention they deserve. The primary goals of this note are to isolate limitative explanations and provide a preliminary account of what makes them e…
Does the no miracles argument apply to AI
According to the standard no miracles argument, science’s predictive success is best explained by the approximate truth of its theories. In contemporary science, however, machine learning systems, such as AlphaFold2, are also remarkably predictively successful. Thus, we might ask what best explains such successes. Might these AIs accurately represent critical aspects of their targets in the world? And if so, does a variant of the no miracles argu…
Computation in Context
Unlimited pancomputationalism is the claim that every physical system implements every computational model simultaneously. Some philosophers argue that unlimited pancomputationalism renders implementation ‘trivial’ or ‘vacuous’, unsuitable for serious scientific work. A popular and natural reaction to this argument is to reject unlimited pancomputationalism. However, I argue that given certain assumptions about the nature of computational ascript…
Computability, Logic, AI Algorithms (7 obras) · Epistemology (7 obras) · Philosophy (7 obras) · Computer Science (6 obras) · Philosophy and History of Science (5 obras) · Philosophy of science (4 obras) · Algorithm (3 obras) · Artificial Intelligence (3 obras) · Artificial Intelligence (3 obras) · Cognitive science (3 obras)