Results for 'well-defined computational procedure that'

967 found
Order:
  1.  56
    Boolean Algebras, Tarski Invariants, and Index Sets.Barbara F. Csima, Antonio Montalbán & Richard A. Shore - 2006 - Notre Dame Journal of Formal Logic 47 (1):1-23.
    Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  60
    Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Filippos A. Papagiannopoulos - 2018 - Dissertation, University of Western Ontario
    This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Philippos Papayannopoulos - 2018 - Dissertation,
    This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Recipes, algorithms, and programs.Carol E. Cleland - 2001 - Minds and Machines 11 (2):219-237.
    In the technical literature of computer science, the concept of an effective procedure is closely associated with the notion of an instruction that precisely specifies an action. Turing machine instructions are held up as providing paragons of instructions that "precisely describe" or "well define" the actions they prescribe. Numerical algorithms and computer programs are judged effective just insofar as they are thought to be translatable into Turing machine programs. Nontechnical procedures (e.g., recipes, methods) are summarily dismissed (...)
    Direct download (15 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  5.  36
    The Epistemological Consequences of Artificial Intelligence, Precision Medicine, and Implantable Brain-Computer Interfaces.Ian Stevens - 2024 - Voices in Bioethics 10.
    ABSTRACT I argue that this examination and appreciation for the shift to abductive reasoning should be extended to the intersection of neuroscience and novel brain-computer interfaces too. This paper highlights the implications of applying abductive reasoning to personalized implantable neurotechnologies. Then, it explores whether abductive reasoning is sufficient to justify insurance coverage for devices absent widespread clinical trials, which are better applied to one-size-fits-all treatments. INTRODUCTION In contrast to the classic model of randomized-control trials, often with a large number (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  41
    Expertise in Non-Well-Defined Task Domains: The Case of Reading.Sarah Bro Trasmundi, Edward Baggs, Juan Toro & Sune Vork Steffensen - 2024 - Social Epistemology 38 (1):13-27.
    In this article, we discuss expertise by considering the activity of reading. Cognitive scientists have traditionally conceptualised reading as a single, well-defined task, namely the decoding of letter sequences into meaningful sequences of speech sounds. This definition captures a core feature of the reading activity at the computational level, but it is an overly narrow model of how reading behaviour occurs in the real world. We propose a more expansive model of expertise. In our view, expertise in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  48
    "Grammarless" phrase structure grammar.James Rogers - 1997 - Linguistics and Philosophy 20 (6):721-746.
    We sketch an axiomatic reformalization of Generalized Phrase StructureGrammar (GPSG) – a definition purely within the language ofmathematical logic of the theory GPSG embodies. While this treatment raisesa number of theoretical issues for GPSG, our focus is not thereformalization itself but rather the method we employ. The model-theoreticapproach it exemplifies can be seen as a natural step in the evolution ofconstraint-based theories from their grammar-based antecedents. One goal ofthis paper is to introduce this approach to a broader audience and todemonstrate (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  8.  22
    Arguments for Randomizing.Patrick Suppes - 1982 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:464 - 475.
    Three main lines of arguments are presented as a defense of randomization in experimental design. The first concerns the computational advantages of randomizing when a well-defined underlying theoretical model is not available, as is often the case in much experimentation in the medical and social sciences. The high desirability, even for the most dedicated Bayesians, of physical randomization in some special cases is stressed. The second line of argument concerns communication of methodology and results, especially in terms (...)
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  9. Criticism of individualist and collectivist methodological approaches to social emergence.S. M. Reza Amiri Tehrani - 2023 - Expositions: Interdisciplinary Studies in the Humanities 15 (3):111-139.
    ABSTRACT The individual-community relationship has always been one of the most fundamental topics of social sciences. In sociology, this is known as the micro-macro relationship while in economics it refers to the processes, through which, individual actions lead to macroeconomic phenomena. Based on philosophical discourse and systems theory, many sociologists even use the term "emergence" in their understanding of micro-macro relationship, which refers to collective phenomena that are created by the cooperation of individuals, but cannot be reduced to individual (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  95
    Labelled resolution for classical and non-classical logics.D. M. Gabbay & U. Reyle - 1997 - Studia Logica 59 (2):179-216.
    Resolution is an effective deduction procedure for classical logic. There is no similar "resolution" system for non-classical logics (though there are various automated deduction systems). The paper presents resolution systems for intuistionistic predicate logic as well as for modal and temporal logics within the framework of labelled deductive systems. Whereas in classical predicate logic resolution is applied to literals, in our system resolution is applied to L(abelled) R(epresentation) S(tructures). Proofs are discovered by a refutation procedure defined (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  46
    Equational characterization of the subvarieties of BL generated by t-Norm algebras.Fransesc Esteva, Lluís Godo & Franco Montagna - 2004 - Studia Logica 76 (2):161 - 200.
    In this paper we show that the subvarieties of BL, the variety of BL-algebras, generated by single BL-chains on [0, 1], determined by continous t-norms, are finitely axiomatizable. An algorithm to check the subsethood relation between these subvarieties is provided, as well as another procedure to effectively find the equations of each subvariety. From a logical point of view, the latter corresponds to find the axiomatization of every residuated many-valued calculus defined by a continuous t-norm and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  12.  58
    Is there a nonrecursive decidable equational theory?Benjamin Wells - 2002 - Minds and Machines 12 (2):301-324.
    The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  46
    Burdens of Proposing.David Godden & Simon Wells - 2022 - Informal Logic 44 (1):291-342.
    This paper considers the probative burdens of proposing action or policy options in deliberation dialogues. Do proposers bear a burden of proof? Building on pioneering work by Douglas Walton (2010), and following on a growing literature within computer science, the prevailing answer seems to be “No.” Instead, only recommenders—agents who put forward an option as the one to be taken—bear a burden of proof. Against this view, we contend that proposers have burdens of proof with respect to their proposals. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  51
    Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
    In (Fund Math 60:175–186 1967), Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal chains in all computable wpos. However, we prove that almost every set, in the sense of category, can compute maximal chains (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  15.  94
    Frege on Definitions: A Case Study of Semantic Content.John Horty - 2007 - , US: Oup Usa.
    In this short monograph, John Horty explores the difficulties presented for Gottlob Frege's semantic theory, as well as its modern descendents, by the treatment of defined expressions. The book begins by focusing on the psychological constraints governing Frege's notion of sense, or meaning, and argues that, given these constraints, even the treatment of simple stipulative definitions led Frege to important difficulties. Horty is able to suggest ways out of these difficulties that are both philosophically and logically (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  16.  34
    Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.
    The classical Hahn–Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari Downey, Ishihara and others and it is known that the theorem does not admit a general computable version. We prove a new computable version of this theorem without unrolling the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  17. Nierozstrzygalność i algorytmiczna niedostępność w naukach społecznych.Witold Marciszewski - 2004 - Filozofia Nauki 3.
    The paper is meant as a survey of issues in computational complexity from the standpoint of its relevance to social research. Moreover, the threads are hinted at that lead to computer science from mathematical logic and from philosophical questions about the limits and the power both of mathematics and the human mind. Especially, the paper addresses Turing's idea of oracle, considering its impact on computational (i.e., relying on simulations) economy, sociology etc. Oracle is meant as a device (...)
    No categories
     
    Export citation  
     
    Bookmark  
  18.  98
    Rational Use of Cognitive Resources: Levels of Analysis Between the Computational and the Algorithmic.Thomas L. Griffiths, Falk Lieder & Noah D. Goodman - 2015 - Topics in Cognitive Science 7 (2):217-229.
    Marr's levels of analysis—computational, algorithmic, and implementation—have served cognitive science well over the last 30 years. But the recent increase in the popularity of the computational level raises a new challenge: How do we begin to relate models at different levels of analysis? We propose that it is possible to define levels of analysis that lie between the computational and the algorithmic, providing a way to build a bridge between computational- and algorithmic-level models. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   64 citations  
  19.  32
    Contract as automaton: representing a simple financial agreement in computational form.Mark D. Flood & Oliver R. Goodenough - 2022 - Artificial Intelligence and Law 30 (3):391-416.
    We show that the fundamental legal structure of a well-written financial contract follows a state-transition logic that can be formalized mathematically as a finite-state machine (specifically, a deterministic finite automaton or DFA). The automaton defines the states that a financial relationship can be in, such as “default,” “delinquency,” “performing,” etc., and it defines an “alphabet” of events that can trigger state transitions, such as “payment arrives,” “due date passes,” etc. The core of a contract describes (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  25
    Computability and the Symmetric Difference Operator.Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller & Noah D. Schweber - 2022 - Logic Journal of the IGPL 30 (3):499-518.
    Combinatorial operations on sets are almost never well defined on Turing degrees, a fact so obvious that counterexamples are worth exhibiting. The case we focus on is the symmetric-difference operator; there are pairs of degrees for which the symmetric-difference operation is well defined. Some examples can be extracted from the literature, e.g. from the existence of nonzero degrees with strong minimal covers. We focus on the case of incomparable r.e. degrees for which the symmetric-difference operation (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  72
    Diagnosis and management of dementia in primary care at an early stage: The need for a new concept and an adapted procedure.Jan De Lepeleire & Jan Heyrman - 1999 - Theoretical Medicine and Bioethics 20 (3):213-226.
    Diagnosis of dementia in primary care is both difficult and important. The recommendations by several authors to improve the diagnosis of dementia by general practitioners are important, but insufficient. It is argued that perhaps the disease concept in itself is a cause of confusion for clinicians. Primary care physicians need an adapted procedure, gradually leading to the final diagnosis of dementia. It has to be a stepwise labelling strategy, using global descriptions and non-disease specific labels in the beginning, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  73
    About and Around Computing Over the Reals.Solomon Feferman - unknown
    1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of course (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  23.  22
    Tableaux for constructive concurrent dynamic logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  24.  21
    Whistleblowing Procedures as Part of the Compliance System and Culture of the Organization.Magdalena Kun-Buczko - 2023 - Studies in Logic, Grammar and Rhetoric 68 (1):541-554.
    The whistleblower system assumes that an element necessary for proper functioning about an organization is to see irregularities occurring in it. For this reason, whistleblowing and follow-up internal investigations occupy a central place in the organization’s compliance management system and an important role in the organization’s culture. These two areas constantly complement each other. However, compliance systems seem to be a broader concept, where the organization’s culture is part of it. The culture of an organization represents the habits, traditions, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  65
    Computational Tractability and Conceptual Coherence.Paul Thagard - 1993 - Canadian Journal of Philosophy 23 (3):349-363.
    According to Church’s thesis, we can identify the intuitive concept of effective computability with such well-defined mathematical concepts as Turing computability and partial recursiveness. The almost universal acceptance of Church’s thesis among logicians and computer scientists is puzzling from some epistemological perspectives, since no formal proof is possible of a thesis that involves an informal concept such as effectiveness. Elliott Mendelson has recently argued, however, that equivalencies between intuitive notions and precise notions need not always be (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  26.  26
    Achieving a Maximum Level of Vaccination for Medical Students: a Rigourous Ethical and Legal Framework Procedure.Sophie Laflamme & Guillaume Laurin-Taillefer - 2014 - Journal of Academic Ethics 12 (3):179-189.
    The Faculty of Medicine and Health Sciences of the University of Sherbrooke has observed year after year, that certain students have not started and or completed their immunizations for common infectious diseases, which in effect makes them inadmissible for their clinical internships in healthcare establishments. The program administrators have posed a series of questions on the best way to proceed with these students as, a certain number remain reluctant to vaccination. They are often confronted with ethical dilemmas, are not (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. Computing with causal theories.Erkan Tin & Varol Akman - 1992 - International Journal of Pattern Recognition and Artificial Intelligence 6 (4):699-730.
    Formalizing commonsense knowledge for reasoning about time has long been a central issue in AI. It has been recognized that the existing formalisms do not provide satisfactory solutions to some fundamental problems, viz. the frame problem. Moreover, it has turned out that the inferences drawn do not always coincide with those one had intended when one wrote the axioms. These issues call for a well-defined formalism and useful computational utilities for reasoning about time and change. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28. (1 other version)Computation and the Brain.Patricia Smith Churchland, Rick Grush, Rob Wilson & Frank Keil - unknown
    Two very different insights motivate characterizing the brain as a computer. One depends on mathematical theory that defines computability in a highly abstract sense. Here the foundational idea is that of a Turing machine. Not an actual machine, the Turing machine is really a conceptual way of making the point that any well-defined function could be executed, step by step, according to simple 'if-you-are-in-state-P-and-have-input-Q-then-do-R' rules, given enough time (maybe infinite time) [see COMPUTATION]. Insofar as the (...)
     
    Export citation  
     
    Bookmark   1 citation  
  29.  70
    An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
    A linear order is -decidable if its universe is and the relations defined by formulas are uniformly computable. This means that there is a computable procedure which, when applied to a formula and a sequence of elements of the linear order, will determine whether or not is true in the structure. A linear order is decidable if the relations defined by all formulas are uniformly computable. These definitions suggest two questions. Are there, for each , -decidable (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  84
    A Philosophical Inquiry into the Nature of Computer Art.Holle Humphries - 2003 - Journal of Aesthetic Education 37 (1):13.
    In lieu of an abstract, here is a brief excerpt of the content:The Journal of Aesthetic Education 37.1 (2003) 13-31 [Access article in PDF] A Philosophical Inquiry into the Nature of Computer Art Holle Humphries Before the computer is accepted unquestioningly as a legitimate artistic medium, some of the challenging aesthetic and philosophical issues raised by [computer art] must be solved. The most haunting questions concern the impact of the technology on the artist, the creative process, and the nature of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  31.  2
    Procedural fairness in algorithmic decision-making: the role of public engagement.Marie Christin Decker, Laila Wegner & Carmen Leicht-Scholten - 2025 - Ethics and Information Technology 27 (1):1-16.
    Despite the widespread use of automated decision-making (ADM) systems, they are often developed without involving the public or those directly affected, leading to concerns about systematic biases that may perpetuate structural injustices. Existing formal fairness approaches primarily focus on statistical outcomes across demographic groups or individual fairness, yet these methods reveal ambiguities and limitations in addressing fairness comprehensively. This paper argues for a holistic approach to algorithmic fairness that integrates procedural fairness, considering both decision-making processes and their outcomes. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32. OAE: The Ontology of Adverse Events.Yongqun He, Sirarat Sarntivijai, Yu Lin, Zuoshuang Xiang, Abra Guo, Shelley Zhang, Desikan Jagannathan, Luca Toldo, Cui Tao & Barry Smith - 2014 - Journal of Biomedical Semantics 5 (29):1-13.
    A medical intervention is a medical procedure or application intended to relieve or prevent illness or injury. Examples of medical interventions include vaccination and drug administration. After a medical intervention, adverse events (AEs) may occur which lie outside the intended consequences of the intervention. The representation and analysis of AEs are critical to the improvement of public health. Description: The Ontology of Adverse Events (OAE), previously named Adverse Event Ontology (AEO), is a community-driven ontology developed to standardize and integrate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  33. Computation, among other things, is beneath us.Selmer Bringsjord - 1994 - Minds and Machines 4 (4):469-88.
    What''s computation? The received answer is that computation is a computer at work, and a computer at work is that which can be modelled as a Turing machine at work. Unfortunately, as John Searle has recently argued, and as others have agreed, the received answer appears to imply that AI and Cog Sci are a royal waste of time. The argument here is alarmingly simple: AI and Cog Sci (of the Strong sort, anyway) are committed to the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  34.  27
    Incremental computation for structured argumentation over dynamic DeLP knowledge bases.Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Gerardo I. Simari & Guillermo R. Simari - 2021 - Artificial Intelligence 300 (C):103553.
    Structured argumentation systems, and their implementation, represent an important research subject in the area of Knowledge Representation and Reasoning. Structured argumentation advances over abstract argumentation frameworks by providing the internal construction of the arguments that are usually defined by a set of (strict and defeasible) rules. By considering the structure of arguments, it becomes possible to analyze reasons for and against a conclusion, and the warrant status of such a claim in the context of a knowledge base represents (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35. Effective Procedures.Nathan Salmon - 2023 - Philosophies 8 (2):27.
    This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  36. Computation and intentional psychology.Murat Aydede - 2000 - Dialogue 39 (2):365-379.
    The relation between computational and intentional psychology has always been a vexing issue. The worry is that if mental processes are computational, then these processes, which are defined over symbols, are sensitive solely to the non-semantic properties of symbols. If so, perhaps psychology could dispense with adverting in its laws to intentional/semantic properties of symbols. Stich, as is well-known, has made a great deal out of this tension and argued for a purely "syntactic" psychology by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  37.  44
    Internal Perception: The Role of Bodily Information in Concepts and Word Mastery.Luigi Pastore & Sara Dellantonio - 2017 - Berlin, Heidelberg: Springer Berlin Heidelberg. Edited by Luigi Pastore.
    Chapter 1 First Person Access to Mental States. Mind Science and Subjective Qualities -/- Abstract. The philosophy of mind as we know it today starts with Ryle. What defines and at the same time differentiates it from the previous tradition of study on mind is the persuasion that any rigorous approach to mental phenomena must conform to the criteria of scientificity applied by the natural sciences, i.e. its investigations and results must be intersubjectively and publicly controllable. In Ryle’s view, (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  38.  94
    Programs, grammars and arguments: A personal view of some connections between computation, language and logic.J. Lambek - 1997 - Bulletin of Symbolic Logic 3 (3):312-328.
    As an undergraduate I was taught to multiply two numbers with the help of log tables, using the formulaHaving graduated to teach calculus to Engineers, I learned that log tables were to be replaced by slide rules. It was then that Imade the fateful decision that there was no need for me to learn how to use this tedious device, as I could always rely on the students to perform the necessary computations. In the course of time, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  39.  28
    Anthropological Perspectives in Psychiatric Nosology.Juan J. López-Ibor Jr & María-Inés López-Ibor - 2008 - Philosophy, Psychiatry, and Psychology 15 (3):259-263.
    In lieu of an abstract, here is a brief excerpt of the content:Anthropological Perspectives in Psychiatric NosologyJuan J. López-Ibor Jr. (bio) and María-Inés López-Ibor (bio)KeywordsDSM, etiology, Aristotelian causes, social dramasPsychiatry and clinical psychology, as we learn in this paper, are disciplines in need of an ontological perspective. Very few branches of contemporary learning share this characteristic. Probably only theoretical physic and theology—as the rest have long ago given up trying to define and understand the essence of their object, for example, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  40.  34
    Computing is at best a special kind of thinking.James H. Fetzer - 2000 - In The Proceedings of the Twentieth World Congress of Philosophy, Volume 9: Philosophy of Mind. Charlottesville: Philosophy Doc Ctr. pp. 103-113.
    When computing is defined as the causal implementation of algorithms and algorithms are defined as effective decision procedures, human thought is mental computation only if it is governed by mental algorithms. An examination of ordinary thinking, however, suggests that most human thought processes are non-algorithmic. Digital machines, moreover, are mark-manipulating or string-processing systems whose marks or strings do not stand for anything for those systems, while minds are semiotic (or “signusing”) systems for which signs stand for other (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  63
    An effective metacognitive strategy: learning by doing and explaining with a computer‐based Cognitive Tutor.Vincent A. W. M. M. Aleven & Kenneth R. Koedinger - 2002 - Cognitive Science 26 (2):147-179.
    Recent studies have shown that self‐explanation is an effective metacognitive strategy, but how can it be leveraged to improve students' learning in actual classrooms? How do instructional treatments that emphasizes self‐explanation affect students' learning, as compared to other instructional treatments? We investigated whether self‐explanation can be scaffolded effectively in a classroom environment using a Cognitive Tutor, which is intelligent instructional software that supports guided learning by doing. In two classroom experiments, we found that students who explained (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  42.  37
    On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.
    In [5] it has been shown that for first-order definability over the reals there exists an effective procedure which by a finite formula with equality defining an open set produces a finite formula without equality that defines the same set. In this paper we prove that there exists no such procedure for Σ-definability over the reals. We also show that there exists even no uniform effective transformation of the definitions of Σ-definable sets into new (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  76
    What's in a function?Gian Aldo Antonelli - 1996 - Synthese 107 (2):167 - 204.
    In this paper we argue that Revision Rules, introduced by Anil Gupta and Nuel Belnap as a tool for the analysis of the concept of truth, also provide a useful tool for defining computable functions. This also makes good on Gupta's and Belnap's claim that Revision Rules provide a general theory of definition, a claim for which they supply only the example of truth. In particular we show how Revision Rules arise naturally from relaxing and generalizing a classical (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  44.  30
    On the Structure of Computable Reducibility on Equivalence Relations of Natural Numbers.Uri Andrews, Daniel F. Belin & Luca San Mauro - 2023 - Journal of Symbolic Logic 88 (3):1038-1063.
    We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  10
    A Procedural Theory of Concepts and the Problem of Synthetic a Priori.Marie Duží & Materna Pavel - 2004 - Korean Journal of Logic 7 (1):1-22.
    The Kantian idea that some judgments are synthetic even in the area of a priori judgments cannot be accepted in its original version, but a modification of the notions analytic' and 'synthetic' discovers a rational core of that idea. The new definition of 'analytic' concerns concepts and makes it possible to distinguish between analytic concepts, which are effective ways of computing recursive functions, and synthetic concepts, which either define non-recursive functions, or define recursive functions in an ineffective way. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. A Computational Constructivist Model as an Anticipatory Learning Mechanism for Coupled Agent–Environment Systems.F. S. Perotto - 2013 - Constructivist Foundations 9 (1):46-56.
    Context: The advent of a general artificial intelligence mechanism that learns like humans do would represent the realization of an old and major dream of science. It could be achieved by an artifact able to develop its own cognitive structures following constructivist principles. However, there is a large distance between the descriptions of the intelligence made by constructivist theories and the mechanisms that currently exist. Problem: The constructivist conception of intelligence is very powerful for explaining how cognitive development (...)
     
    Export citation  
     
    Bookmark   1 citation  
  47.  42
    Resolving the paradox of the active user: stable suboptimal performance in interactive tasks.Wai-Tat Fu & Wayne D. Gray - 2004 - Cognitive Science 28 (6):901-935.
    This paper brings the intellectual tools of cognitive science to bear on resolving the “paradox of the active user” [Interfacing Thought: Cognitive Aspects of Human–Computer Interaction, Cambridge, MIT Press, MA, USA]—the persistent use of inefficient procedures in interactive tasks by experienced or even expert users when demonstrably more efficient procedures exist. The goal of this paper is to understand the roots of this paradox by finding regularities in these inefficient procedures. We examine three very different data sets. For each data (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  48.  38
    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 (...)
  49. W poszukiwaniu ontologicznych podstaw prawa. Arthura Kaufmanna teoria sprawiedliwości [In Search for Ontological Foundations of Law: Arthur Kaufmann’s Theory of Justice].Marek Piechowiak - 1992 - Instytut Nauk Prawnych PAN.
    Arthur Kaufmann is one of the most prominent figures among the contemporary philosophers of law in German speaking countries. For many years he was a director of the Institute of Philosophy of Law and Computer Sciences for Law at the University in Munich. Presently, he is a retired professor of this university. Rare in the contemporary legal thought, Arthur Kaufmann's philosophy of law is one with the highest ambitions — it aspires to pinpoint the ultimate foundations of law by explicitly (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  28
    A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time.Alfredo Burrieza & Inma P. De Guzmán - 1992 - Journal of Applied Non-Classical Logics 2 (2):181-200.
    ABSTRACT In this paper we present a new semantic approach for propositional linear temporal logic with discrete time, strongly based in the well-order of IN (the set of natural numbers). We consider temporal connectives which express precedence, posteriority and simultaneity, and they provide a family of expressively complete temporal logics. The selection of the new semantics and connectives used in this work was principally to obtain a suitable executable temporal logic, which can be used for the specification and control (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 967