Switch to: References

Citations of:

On effective procedures

Minds and Machines 12 (2):159-179 (2002)

Add citations

You must login to add citations.
  1. Procedural Semantics for Hyperintensional Logic: Foundations and Applications of Transparent Intensional Logic.Marie Duží, Bjorn Jespersen & Pavel Materna - 2010 - Dordrecht, Netherland: Springer.
    The book is about logical analysis of natural language. Since we humans communicate by means of natural language, we need a tool that helps us to understand in a precise manner how the logical and formal mechanisms of natural language work. Moreover, in the age of computers, we need to communicate both with and through computers as well. Transparent Intensional Logic is a tool that is helpful in making our communication and reasoning smooth and precise. It deals with all kinds (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • Why Do We Need a Theory of Implementation?Andre Curtis-Trudel - forthcoming - British Journal for the Philosophy of Science.
    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 paper 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 relationship between physical and mathematical computation.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Towards an Extensional Calculus of Hyperintensions.Marie Duží - 2012 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 19:20-45.
  • Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
    Under what conditions does a physical system implement or realize a computation? Structuralism about computational implementation, espoused by Chalmers and others, holds that a physical system realizes a computation just in case the system instantiates a pattern of causal organization isomorphic to the computation’s formal structure. I argue against structuralism through counter-examples drawn from computer science. On my opposing view, computational implementation sometimes requires instantiating semantic properties that outstrip any relevant pattern of causal organization. In developing my argument, I defend (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • If Structured Propositions Are Logical Procedures Then How Are Procedures Individuated?Marie Duží - 2019 - Synthese 196 (4):1249-1283.
    This paper deals with two issues. First, it identifies structured propositions with logical procedures. Second, it considers various rigorous definitions of the granularity of procedures, hence also of structured propositions, and comes out in favour of one of them. As for the first point, structured propositions are explicated as algorithmically structured procedures. I show that these procedures are structured wholes that are assigned to expressions as their meanings, and their constituents are sub-procedures occurring in executed mode. Moreover, procedures are not (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Justifying Method Choice: A Heuristic-Instrumentalist Account of Scientific Methodology.Till Grüne-Yanoff - 2020 - Synthese 199 (1-2):3903-3921.
    Scientific methods are heuristic in nature. Heuristics are simplifying, incomplete, underdetermined and fallible problem-solving rules that can nevertheless serve certain goals in certain contexts better than truth-preserving algorithms. Because of their goal- and context-dependence, a framework is needed for systematic choosing between them. This is the domain of scientific methodology. Such a methodology, I argue, relies on a form of instrumental rationality. Three challenges to such an instrumentalist account are addressed. First, some authors have argued that the rational choice of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Concepts and Recipes.Pavel Materna - 2009 - Acta Analytica 24 (1):69-90.
    If concepts are explicated as abstract procedures, then we can easily show that each empirical concept is a not an effective procedure. Some, but not all empirical concepts are shown to be of a special kind: they cannot in principle guarantee that the object they identify satisfies the intended conditions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Triviality Arguments Against Functionalism.Peter Godfrey-Smith - 2009 - Philosophical Studies 145 (2):273 - 295.
    “Triviality arguments” against functionalism in the philosophy of mind hold that the claim that some complex physical system exhibits a given functional organization is either trivial or has much less content than is usually supposed. I survey several earlier arguments of this kind, and present a new one that overcomes some limitations in the earlier arguments. Resisting triviality arguments is possible, but requires functionalists to revise popular views about the “autonomy” of functional description.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  • Computation, Implementation, Cognition.Oron Shagrir - 2012 - Minds and Machines 22 (2):137-148.
    Putnam (Representations and reality. MIT Press, Cambridge, 1988) and Searle (The rediscovery of the mind. MIT Press, Cambridge, 1992) famously argue that almost every physical system implements every finite computation. This universal implementation claim, if correct, puts at the risk of triviality certain functional and computational views of the mind. Several authors have offered theories of implementation that allegedly avoid the pitfalls of universal implementation. My aim in this paper is to suggest that these theories are still consistent with a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Algorithmic Measurement Procedures.Aldo F. G. Solis-Labastida & Jorge G. Hirsch - 2020 - Foundations of Physics 50 (8):749-763.
    Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we draw some limitations for measurement procedures: procedures that verify if a quantity is measured cannot work in every case.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • A Theory of Computational Implementation.Michael Rescorla - 2014 - Synthese 191 (6):1277-1307.
    I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with mechanical instructions encoded by the model. I contrast my theory with an influential approach to computational implementation espoused by Chalmers, Putnam, and others. I deploy my theory (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations