Search results for 'Logic machines' (try it on Scholar)

1000+ found
Sort by:
  1. Martin Gardner (1982). Logic Machines and Diagrams. University of Chicago Press.score: 210.0
     
    My bibliography  
     
    Export citation  
  2. Martin Gardner (1958/1968). Logic Machines, Diagrams and Boolean Algebra. New York, Dover Publications.score: 210.0
     
    My bibliography  
     
    Export citation  
  3. Alonzo Church (1952). Review: Martin Gardner, Logic Machines. [REVIEW] Journal of Symbolic Logic 17 (3):217-217.score: 156.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. W. Mays (1959). Review: Martin Gardner, Logic Machines and Diagrams. [REVIEW] Journal of Symbolic Logic 24 (1):78-79.score: 156.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. David Deutsch, Artur Ekert & Rossella Lupacchini (2000). Machines, Logic and Quantum Physics. Bulletin of Symbolic Logic 6 (3):265-283.score: 126.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Robert McNaughton (1971). Review: Dean N. Arden, Delayed-Logic and Finite-State Machines. [REVIEW] Journal of Symbolic Logic 36 (1):151-151.score: 126.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. George W. Patterson (1952). Review: Edmund C. Berkeley, The Relations Between Symbolic Logic and Large-Scale Calculating Machines. [REVIEW] Journal of Symbolic Logic 17 (1):78-78.score: 126.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Robert F. Barnes (1973). Review: Alice Mary Hilton, Logic, Computing Machines, and Automation. [REVIEW] Journal of Symbolic Logic 38 (2):341-342.score: 126.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Diana Raffman Deutsch, George Schumm & Neil Tennant (1998). Clusions From Gödel's Incompleteness Theorems, and Related Results From Mathematical Logic. Languages, Minds, and Machines Figure Prominently in the Discussion. Gödel's Theorems Surely Tell Us Something About These Important Matters. But What? A Descriptive Title for This Paper Would Be “Gödel, Lucas, Penrose, Tur. [REVIEW] Bulletin of Symbolic Logic 4 (3).score: 126.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Arthur W. Burks, Application of Logic to the Design of Computing Machines : Final Report.score: 120.0
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  11. Antje Nowack (2005). A Guarded Fragment for Abstract State Machines. Journal of Logic, Language and Information 14 (3):345-368.score: 108.0
    Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal and formal methods. Applications of this method motivate a number of computability and decidability problems connected to ASMs. Such problems result for example from the area of verifying properties of ASMs. Their high expressive power leads rather directly to undecidability respectively uncomputability results for most interesting problems in the case of unrestricted ASMs. Consequently, it is rather natural (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  12. Majid Amini (2008). Logical Machines: Peirce on Psychologism. Disputatio 2 (24):1 - 14.score: 96.0
    This essay discusses Peirce�s appeal to logical machines as an argument against psychologism. It also contends that some of Peirce�s anti-psychologistic remarks on logic contain interesting premonitions arising from his perception of the asymmetry of proof complexity in monadic and relational logical calculi that were only given full formulation and explication in the early twentieth century through Church�s Theorem and Hilbert�s broad-ranging Entscheidungsproblem.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Eric Steinhart (2002). Logically Possible Machines. Minds and Machines 12 (2):259-280.score: 94.0
    I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines (...)
    Direct download (16 more)  
     
    My bibliography  
     
    Export citation  
  14. George W. Patterson (1953). Review: W. Mays, D. P. Henry, Logical Machines. New Light on W. Stanley Jevons. [REVIEW] Journal of Symbolic Logic 18 (1):69-69.score: 76.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  15. Ann M. Singleterry (1966). Review: Laszlo Kalmar, A New Principle of Construction of Logical Machines. [REVIEW] Journal of Symbolic Logic 31 (3):516-516.score: 76.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  16. Andrzej J. Blikle (1967). Review: David A. Huffman, Canonical Forms for Information-Lossless Finite-State Logical Machines. [REVIEW] Journal of Symbolic Logic 32 (3):389-389.score: 76.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Robert McNaughton (1962). Review: Alan Rose, Many-Valued Logical Machines. [REVIEW] Journal of Symbolic Logic 27 (2):250-250.score: 76.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. George W. Patterson (1952). Review: W. Mays, C. E. M. Hansel, D. P. Henry, Note on the Exhibition of Logical Machines at the Joint Session, July 1950. [REVIEW] Journal of Symbolic Logic 17 (1):77-78.score: 76.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  19. Ann M. Singleterry (1996). Kalmár László. A New Principle of Construction of Logical Machines. 2e Congrès International de Cybernétique, Namur, 3–10 Septembre 1958, Actes, Association Internationale de Cybernétique, Namur 1960, Pp. 458–463. [REVIEW] Journal of Symbolic Logic 31 (3):516-516.score: 76.0
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  20. Martin Davis (ed.) (1965/2004). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication.score: 72.0
    "A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  21. Michał Walicki (2012). Introduction to Mathematical Logic. World Scientific.score: 66.0
    A history of logic -- Patterns of reasoning -- A language and its meaning -- A symbolic language -- 1850-1950 mathematical logic -- Modern symbolic logic -- Elements of set theory -- Sets, functions, relations -- Induction -- Turning machines -- Computability and decidability -- Propositional logic -- Syntax and proof systems -- Semantics of PL -- Soundness and completeness -- First order logic -- Syntax and proof systems of FOL -- Semantics of FOL (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  22. A. A. Mullin (1962). Review: Alan Rose, A Note on the Use of Logical Computers to Determine the Most Efficient Method of Using Factory Machines; Alan Rose, A High Speed Parallel Adder. [REVIEW] Journal of Symbolic Logic 27 (2):251-251.score: 66.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Charles Rackoff (1986). Review: Anna R. Bruss, Albert R. Meyer, On Time-Space Classes and Their Relation to the Theory of Real Addition; Leonard Berman, The Complexity of Logical Theories; Hugo Volger, Turing Machines with Linear Alternation, Theories of Bounded Concatenation. [REVIEW] Journal of Symbolic Logic 51 (3):817-818.score: 66.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi & Gregor Weckbecker (2010). The Basic Theory of Infinite Time Register Machines. Archive for Mathematical Logic 49 (2):249-273.score: 64.0
    Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands. At limit times register contents are defined by appropriate limit operations. In this paper, we examine the ITRMs introduced by the third and fourth author (Koepke and Miller in Logic and Theory of Algorithms LNCS, pp. 306–315, 2008), where a register content at a limit (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  25. Samuel A. Alexander (2014). A Machine That Knows Its Own Code. Studia Logica 102 (3):567-576.score: 60.0
    We construct a machine that knows its own code, at the price of not knowing its own factivity.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  26. Y. Sato & T. Ikegami (2004). Undecidability in the Imitation Game. Minds and Machines 14 (2):133-43.score: 60.0
    This paper considers undecidability in the imitation game, the so-called Turing Test. In the Turing Test, a human, a machine, and an interrogator are the players of the game. In our model of the Turing Test, the machine and the interrogator are formalized as Turing machines, allowing us to derive several impossibility results concerning the capabilities of the interrogator. The key issue is that the validity of the Turing test is not attributed to the capability of human or machine, (...)
    Direct download (20 more)  
     
    My bibliography  
     
    Export citation  
  27. Evert Willem Beth (1966). Mathematical Epistemology and Psychology. New York, Gordon and Breach.score: 60.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Yves Lafont (1996). The Undecidability of Second Order Linear Logic Without Exponentials. Journal of Symbolic Logic 61 (2):541-548.score: 60.0
    Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of two-counter machines originally due to Kanovich. The (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  29. Jessica Davidson (1971). The Square Root of Tuesday. New York,Mccall Pub. Co..score: 60.0
     
    My bibliography  
     
    Export citation  
  30. Storrs McCall (1999). Can a Turing Machine Know That the Godel Sentence is True? Journal of Philosophy 96 (10):525-32.score: 58.0
  31. C. T. K. Chari (1963). Further Comments on Minds, Machines and Godel. Philosophy 38 (April):175-8.score: 58.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. L. Jonathan Cohen (1986). What Sorts of Machines Can Understand the Symbols They Use? Proceedings of the Aristotelian Society 60:81-96.score: 58.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  33. Aaron Sloman (1986). What Sorts of Machines Can Understand the Symbols They Use? Proceedings of the Aristotelian Society 61:61-80.score: 58.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  34. Gerald Heidegger (1992). Machines, Computers, Dialectics: A New Look at Human Intelligence. [REVIEW] AI and Society 6 (1):27-40.score: 58.0
    The more recent computer developments cause us to take a new look at human intelligence. The prevailing occidental view of human intelligence represents a very one-sided, logocentric approach, so that it is becoming more urgent to look for a more complete view. In this way, specific strengths of so-called human information processing are becoming particularly evident in a new way. To provide a general substantiation for this view, some elements of a phenomenological model for a dialectical coherence of human expressions (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Hava T. Siegelmann (2003). Neural and Super-Turing Computing. Minds and Machines 13 (1):103-114.score: 56.0
    ``Neural computing'' is a research field based on perceiving the human brain as an information system. This system reads its input continuously via the different senses, encodes data into various biophysical variables such as membrane potentials or neural firing rates, stores information using different kinds of memories (e.g., short-term memory, long-term memory, associative memory), performs some operations called ``computation'', and outputs onto various channels, including motor control commands, decisions, thoughts, and feelings. We show a natural model of neural computing that (...)
    Direct download (16 more)  
     
    My bibliography  
     
    Export citation  
  36. Bruce Edmonds (2000). The Constructability of Artificial Intelligence (as Defined by the Turing Test). Journal of Logic Language and Information 9 (4):419-424.score: 56.0
    The Turing Test (TT), as originally specified, centres on theability to perform a social role. The TT can be seen as a test of anability to enter into normal human social dynamics. In this light itseems unlikely that such an entity can be wholly designed in anoff-line mode; rather a considerable period of training insitu would be required. The argument that since we can pass the TT,and our cognitive processes might be implemented as a Turing Machine(TM), that consequently (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  37. B. Maclennan (2003). Transcending Turing Computability. Minds and Machines 13 (1):3-22.score: 56.0
    It has been argued that neural networks and other forms of analog computation may transcend the limits of Turing-machine computation; proofs have been offered on both sides, subject to differing assumptions. In this article I argue that the important comparisons between the two models of computation are not so much mathematical as epistemological. The Turing-machine model makes assumptions about information representation and processing that are badly matched to the realities of natural computation (information representation and processing in or inspired by (...)
    Direct download (21 more)  
     
    My bibliography  
     
    Export citation  
  38. Chris Smeenk & Christian Wuthrich (2011). Time Travel and Time Machines. In Craig Callender (ed.), The Oxford Handbook of Philosophy of Time. Oxford University Press.score: 54.0
    This paper is an enquiry into the logical, metaphysical, and physical possibility of time travel understood in the sense of the existence of closed worldlines that can be traced out by physical objects. We argue that none of the purported paradoxes rule out time travel either on grounds of logic or metaphysics. More relevantly, modern spacetime theories such as general relativity seem to permit models that feature closed worldlines. We discuss, in the context of Gödel's infamous argument for the (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Jiji Zhang (2013). A Lewisian Logic of Causal Counterfactuals. Minds and Machines 23 (1):77-93.score: 54.0
    In the artificial intelligence literature a promising approach to counterfactual reasoning is to interpret counterfactual conditionals based on causal models. Different logics of such causal counterfactuals have been developed with respect to different classes of causal models. In this paper I characterize the class of causal models that are Lewisian in the sense that they validate the principles in Lewis’s well-known logic of counterfactuals. I then develop a system sound and complete with respect to this class. The resulting (...) is the weakest logic of causal counterfactuals that respects Lewis’s principles, sits in between the logic developed by Galles and Pearl and the logic developed by Halpern, and stands to Galles and Pearl’s logic in the same fashion as Lewis’s stands to Stalnaker’s. (shrink)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  40. Fenrong Liu & Yanjing Wang (2013). Reasoning About Agent Types and the Hardest Logic Puzzle Ever. Minds and Machines 23 (1):123-161.score: 54.0
    In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  41. Larry Hauser (2000). Ordinary Devices: Reply to Bringsjord's Clarifying the Logic of Anti-Computationalism: Reply to Hauser. [REVIEW] Minds and Machines 10 (1):115-117.score: 54.0
    What Robots Can and Can't Be (hereinafter Robots) is, as Selmer Bringsjord says "intended to be a collection of formal-arguments-that-border-on-proofs for the proposition that in all worlds, at all times, machines can't be minds" (Bringsjord, forthcoming). In his (1994) "Précis of What Robots Can and Can't Be" Bringsjord styles certain of these arguments as proceeding "repeatedly . . . through instantiations of" the "simple schema".
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  42. Satoshi Tojo (1999). Event, State, and Process in Arrow Logic. Minds and Machines 9 (1):81-103.score: 54.0
    Artificial agents, which are embedded in a virtual world, need to interpret a sequence of commands given to them adequately, considering the temporal structure for each command. In this paper, we start with the semantics of natural language and classify the temporal structures of various eventualities into such aspectual classes as action, process, and event. In order to formalize these temporal structures, we adopt Arrow Logic. This logic specifies the domain for the valuation of a sentence as an (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Stuart A. Eisenstadt & Herbert A. Simon (1997). Logic and Thought. Minds and Machines 7 (3):365-385.score: 54.0
    Rips, in The Psychology of Proof, argues that, through the processes of evolution, logic (e.g., modus ponens) has become established in the human mind as the basis for thinking, and that production systems rest on this foundation. In this paper we defend the converse argument that, through evolution, a production system architecture has become the basis for human thinking, and that formal logics rest on this production system and the accompanying mechanisms for recognition and search. It is through the (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  44. Chung Hee Hwang & Lenhart K. Schubert (1993). Episodic Logic: A Comprehensive, Natural Representation for Language Understanding. [REVIEW] Minds and Machines 3 (4):381-419.score: 54.0
    A new comprehensive framework for narrative understanding has been developed. Its centerpiece is a new situational logic calledEpisodic Logic (EL), a knowledge and semantic representation well-adapted to the interpretive and inferential needs of general NLU. The most distinctive features of EL is its natural language-like expressiveness. It allows for generalized quantifiers, lambda abstraction, sentence and predicate modifiers, sentence and predicate reification, intensional predicates (corresponding to wanting, believing, making, etc.), unreliable generalizations, and perhaps most importantly, explicit situational variables ( (...) episodes, events, states of affairs, etc.) linked to arbitrary formulas that describe them. These allow episodes to be explicitly related in terms of part-whole, temporal and causal relations. Episodic logical form is easily computed from surface syntax and lends itself to effective inference. (shrink)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  45. Timothy R. Colburn (1991). Defeasible Reasoning and Logic Programming. Minds and Machines 1 (4):417-436.score: 54.0
    The general conditions of epistemic defeat are naturally represented through the interplay of two distinct kinds of entailment, deductive and defeasible. Many of the current approaches to modeling defeasible reasoning seek to define defeasible entailment via model-theoretic notions like truth and satisfiability, which, I argue, fails to capture this fundamental distinction between truthpreserving and justification-preserving entailments. I present an alternative account of defeasible entailment and show how logic programming offers a paradigm in which the distinction can be captured, (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Raymond J. Nelson (1955). Review: Robert S. Ledley, Mathematical Foundations and Computational Methods for a Digital Logic Machine. [REVIEW] Journal of Symbolic Logic 20 (2):195-197.score: 52.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  47. George W. Patterson (1957). Review: W. Mays, The First Circuit for an Electrical Logic-Machine. [REVIEW] Journal of Symbolic Logic 22 (2):221-222.score: 52.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Raymond J. Nelson (1955). Review: Arthur W. Burks, Don W. Warren, Jesse B. Wright, An Analysis of a Logical Machine Using Parenthesis-Free Notation. [REVIEW] Journal of Symbolic Logic 20 (1):70-71.score: 52.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. August Stern (2000). Quantum Theoretic Machines: What is Thought From the Point of View of Physics. Elsevier.score: 50.0
    Making Sense of Inner Sense 'Terra cognita' is terra incognita. It is difficult to find someone not taken abackand fascinated by the incomprehensible but indisputable fact: there are material systems which are aware of themselves. Consciousness is self-cognizing code. During homo sapiens's relentness and often frustrated search for self-understanding various theories of consciousness have been and continue to be proposed. However, it remains unclear whether and at what level the problems of consciousness and intelligent thought can be resolved. Science's greatest (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Samuel Alexander (2013). Fast-Collapsing Theories. Studia Logica:1-21.score: 50.0
    Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000