Search results for 'Computable functions Data processing' (try it on Scholar)

1000+ found
Sort by:
  1. Lawrence C. Paulson (1987). Logic and Computation: Interactive Proof with Cambridge Lcf. Cambridge University Press.score: 118.5
    Logic and Computation is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of statements in a programming language. This book consists of two parts. Part I outlines the mathematical preliminaries: elementary logic and domain theory. They are explained at an intuitive level, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Michael J. C. Gordon (1979). Edinburgh Lcf: A Mechanised Logic of Computation. Springer-Verlag.score: 105.0
    No categories
     
    My bibliography  
     
    Export citation  
  3. Martin Davis (ed.) (1965/2004). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication.score: 79.5
    "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 by (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Melvin Fitting (1987). Computability Theory, Semantics, and Logic Programming. Clarendon Press.score: 67.5
    This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.
     
    My bibliography  
     
    Export citation  
  5. Peter Smith, Basic Reading on Computable Functions.score: 54.0
    This is an annotated reading list on the beginning elements of the theory of computable functions. It is now structured so as to complement the first eight lectures of Thomas Forster’s Part III course in Lent 2011 (see the first four chapters of his evolving handouts).
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Carol E. Cleland (1995). Effective Procedures and Computable Functions. Minds and Machines 5 (1):9-23.score: 53.5
    Horsten and Roelants have raised a number of important questions about my analysis of effective procedures and my evaluation of the Church-Turing thesis. They suggest that, on my account, effective procedures cannot enter the mathematical world because they have a built-in component of causality, and, hence, that my arguments against the Church-Turing thesis miss the mark. Unfortunately, however, their reasoning is based upon a number of misunderstandings. Effective mundane procedures do not, on my view, provide an analysis of ourgeneral concept (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Erik Andersson (ed.) (1978). Working Papers on Computer Processing of Syntactic Data. Research Institute, Åbo Akademi Foundation.score: 53.0
     
    My bibliography  
     
    Export citation  
  8. Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.score: 52.5
    What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Martha Stone Palmer (2006). Semantic Processing for Finite Domains. Cambridge University Press.score: 52.0
    A primary problem in the area of natural language processing has been semantic analysis. This book looks at the semantics of natural languages in context. It presents an approach to the computational processing of English text that combines current theories of knowledge representation and reasoning in Artificial Intelligence with the latest linguistic views of lexical semantics. The book will interest postgraduates and researchers in computational linguistics as well as industrial research groups specializing in natural language processing.
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Hagen Lindstädt (2001). More Nonconcavities in Information Processing Functions. Theory and Decision 51 (2/4):351-365.score: 49.5
    The productivity of (human) information processing as an economic activity is a question that is raising some interest. Using Marschak's evaluation framework, Radner and Stiglitz have shown that, under certain conditions, the production function of this activity has increasing marginal returns in its initial stage. This paper shows that, under slightly different conditions, this information processing function has repeated convexities with ongoing processing activity. Even for smooth changes in the signals' likelihoods, the function is only piecewise smooth (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Dag Elgesem (1999). The Structure of Rights in Directive 95/46/EC on the Protection of Individuals with Regard to the Processing of Personal Data and the Free Movement of Such Data. [REVIEW] Ethics and Information Technology 1 (4):283-293.score: 48.0
    The paper has three parts. First, a survey and analysis is given ofthe structure of individual rights in the recent EU Directive ondata protection. It is argued that at the core of this structure isan unexplicated notion of what the data subject can `reasonablyexpect' concerning the further processing of information about himor herself. In the second part of the paper it is argued thattheories of privacy popular among philosophers are not able to shed much light on the issues (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Rodney G. Downey & Asher M. Kach (2010). Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52 (2):163-172.score: 48.0
    We study the complexity of (finitely-valued and transfinitely-valued) Euclidean functions for computable Euclidean domains. We examine both the complexity of the minimal Euclidean function and any Euclidean function. Additionally, we draw some conclusions about the proof-theoretical strength of minimal Euclidean functions in terms of reverse mathematics.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Brigitte Krenn (2000). The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations. Dfki.score: 46.0
     
    My bibliography  
     
    Export citation  
  14. Thomas Lorscheid (1983). Evoked Potential Correlates of Semantic Word Processing. Hochschulverlag.score: 46.0
     
    My bibliography  
     
    Export citation  
  15. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.score: 45.0
  16. Martin Davis (1958/1982). Computability & Unsolvability. Dover.score: 43.5
    Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Keith D. Farnsworth, John Nelson & Carlos Gershenson (forthcoming). Living is Information Processing: From Molecules to Global Systems. Acta Biotheoretica.score: 43.0
    We extend the concept that life is an informational phenomenon, at every level of organisation, from molecules to the global ecological system. According to this thesis: (a) living is information processing, in which memory is maintained by both molecular states and ecological states as well as the more obvious nucleic acid coding; (b) this information processing has one overall function—to perpetuate itself; and (c) the processing method is filtration (cognition) of, and synthesis of, information at lower levels (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Patrick Saint-Dizier & Evelyne Viegas (eds.) (1995). Computational Lexical Semantics. Cambridge University Press.score: 41.0
    Lexical semantics has become a major research area within computational linguistics, drawing from psycholinguistics, knowledge representation, computer algorithms and architecture. Research programmes whose goal is the definition of large lexicons are asking what the appropriate representation structure is for different facets of lexical information. Among these facets, semantic information is probably the most complex and the least explored.Computational Lexical Semantics is one of the first volumes to provide models for the creation of various kinds of computerised lexicons for the automatic (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  19. M. A. Nielsen, Computable Functions, Quantum Measurements, and Quantum Dynamics.score: 40.5
    Quantum mechanical measurements on a physical system are represented by observables - Hermitian operators on the state space of the observed system. It is an important question whether all observables may be realized, in principle, as measurements on a physical system. Dirac’s influential text ( [1], page 37) makes the following assertion on the question: The question now presents itself – Can every observable be measured? The answer theoretically is yes. In practice it may be very awkward, or perhaps even (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. Carlos Augusto Priscdio (2002). Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding. [REVIEW] Bulletin of Symbolic Logic 8 (1):101-104.score: 40.5
  21. Samuel Alexander (2006). Formulas for Computable and Non-Computable Functions. Rose-Hulman Undergraduate Mathematics Journal 7 (2).score: 40.5
    Direct download  
     
    My bibliography  
     
    Export citation  
  22. Harley Shands (1973). Other-Than-Neurological Components Basic to Human Data-Processing Operations. World Futures 14 (1):13-32.score: 40.5
  23. Judith Slein (1984). Philosophy and Data Processing. International Journal of Applied Philosophy 2 (1):75-84.score: 40.5
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Simon Thompson (2001). Resenha de 'Propositional Logic: The Semantic Foundations of Logic' (R. L. Epstein) - 'Predicate Logic: The Semantic Foundations of Logic' (R. L. Epstein) - 'Computable Functions, Logic, and the Foundations of Mathematics' (R. L. Epstein and W. A. Carniel. [REVIEW] Manuscrito 24 (1).score: 40.5
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Fernando Ferreira (ed.) (2010). Programs, Proofs, Processes: 6th Conference on Computability in Europe, Cie, 2010, Ponta Delgada, Azores, Portugal, June 30-July 4, 2010 ; Proceedings. [REVIEW] Springer.score: 40.0
    The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form.
    Direct download  
     
    My bibliography  
     
    Export citation  
  26. Leslie Burkholder (ed.) (1992). Philosophy and the Computer. Westview Press.score: 40.0
  27. Edgar Selzer (2011). Denn der Mensch Ist Mehr Als Sein Computer: Warum Die Turing-Maschine Das Wittgenstein'sche Sprachspiel Nicht Bewältigen Kann. Trauner.score: 40.0
     
    My bibliography  
     
    Export citation  
  28. Nir Fresco, Concrete Digital Computation: Competing Accounts and its Role in Cognitive Science.score: 39.5
    There are currently considerable confusion and disarray about just how we should view computationalism, connectionism and dynamicism as explanatory frameworks in cognitive science. A key source of this ongoing conflict among the central paradigms in cognitive science is an equivocation on the notion of computation simpliciter. ‘Computation’ is construed differently by computationalism, connectionism, dynamicism and computational neuroscience. I claim that these central paradigms, properly understood, can contribute to an integrated cognitive science. Yet, before this claim can be defended, a better (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. C. J. Ash (2000). Computable Structures and the Hyperarithmetical Hierarchy. Elsevier.score: 39.0
    This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal (...)
     
    My bibliography  
     
    Export citation  
  30. Gualtiero Piccinini & Andrea Scarantino (2010). Computation Vs. Information Processing: Why Their Difference Matters to Cognitive Science. Studies in History and Philosophy of Science Part A 41 (3):237-246.score: 38.0
    Since the cognitive revolution, it’s become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this paper, we distinguish information processing from computation and examine some of their mutual relations, shedding light on the role each can play in a theory of cognition. We recommend that theoristError: Illegal entry in bfrange (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  31. Hilde Corneliussen (2011). Gender-Technology Relations: Exploring Stability and Change. Palgrave Macmillan.score: 38.0
    Machine generated contents note: -- Acknowledgements -- Disrupting the Impression of Stability in the Gender-Technology Relation -- Changing Images of Computers and its Users since 1980 -- Discursive Developments Within Computer Education -- Variations in Gender-ICT Relations Among Male and Female Computer Students -- Stories About Individual Change and Transformation -- Layered Meanings and Differences Within -- Is there an Elsewhere? -- References -- Endnotes -- Index.
     
    My bibliography  
     
    Export citation  
  32. Michael Levison (2012). The Semantic Representation of Natural Language. Bloomsbury Academic.score: 37.0
    Introduction -- Basic concepts -- Previous approaches -- Semantic expressions: introduction -- Formal issues -- Semantic expressions: basic features -- Advanced features -- Applications: capture -- Three little pigs -- Applications: creation.
     
    My bibliography  
     
    Export citation  
  33. Sebastian Padó (2007). Cross-Lingual Annotation Projection Models for Role-Semantic Information. Saarland University.score: 37.0
     
    My bibliography  
     
    Export citation  
  34. Gualtiero Piccinini & Andrea Scarantino (2011). Information Processing, Computation, and Cognition. Journal of Biological Physics 37 (1):1-38.score: 36.5
    Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree vehemently. Yet different cognitive scientists use ‘computation’ and ‘information processing’ to mean different things, sometimes without realizing that they do. In addition, computation and information processing are surrounded by several myths; first and foremost, that they are (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. George Boolos (2007). Computability and Logic. Cambridge University Press.score: 36.0
    Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also a large number of optional topics, from Turing’s theory of computability to Ramsey’s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  36. Eran Tal (2011). From Data to Phenomena and Back Again: Computer-Simulated Signatures. Synthese 182 (1):117-129.score: 36.0
    This paper draws attention to an increasingly common method of using computer simulations to establish evidential standards in physics. By simulating an actual detection procedure on a computer, physicists produce patterns of data (‘signatures’) that are expected to be observed if a sought-after phenomenon is present. Claims to detect the phenomenon are evaluated by comparing such simulated signatures with actual data. Here I provide a justification for this practice by showing how computer simulations establish the reliability of detection (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  37. Arto Salomaa (1985). Computation and Automata. Cambridge University Press.score: 36.0
    This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
    Direct download  
     
    My bibliography  
     
    Export citation  
  38. George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.score: 36.0
    Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also a large number of optional topics, from Turing’s theory of computability to Ramsey’s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. S. B. Cooper, Benedikt Löwe & Andrea Sorbi (eds.) (2007). New Computational Paradigms: Changing Conceptions of What is Computable. Springer.score: 36.0
    Logicians and theoretical physicists will also benefit from this book.
    Direct download  
     
    My bibliography  
     
    Export citation  
  40. C. L. Haynes, G. A. Cook & M. A. Jones (2007). Legal and Ethical Considerations in Processing Patient-Identifiable Data Without Patient Consent: Lessons Learnt From Developing a Disease Register. Journal of Medical Ethics 33 (5):302-307.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Anthony C. Meis (2004). Deregulation of the Balance Between Data and Conceptually Driven Processing: A Shift Toward the Conceptual. Behavioral and Brain Sciences 27 (6):800-801.score: 36.0
    Behrendt & Young (B&Y) propose that a dysfunction in the reticular thalamic nucleus contributes to disinhibition of specific thalamic nuclei, allowing cortical attention mechanisms to engage thalamic relay neurons, causing underconstrained activation of the cortex and hallucinations. The following hypothesis challenges the notion of impaired sensory gating by providing the alternative view that hypofrontality reduces the power of incoming stimuli, causing internal drives to override consciousness, resulting in hallucinations.
    Direct download  
     
    My bibliography  
     
    Export citation  
  42. Raymond Turner (2009). Computable Models. Springer.score: 36.0
    Raymond Turner first provides a logical framework for specification and the design of specification languages, then uses this framework to introduce and study ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  43. Asher M. Kach & Daniel Turetsky (2010). Limitwise Monotonic Functions, Sets, and Degrees on Computable Domains. Journal of Symbolic Logic 75 (1):131-154.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. E. F. Bradley & O. T. Denmead (eds.) (1967). The Collection and Processing of Field Data. New York, Interscience Publishers.score: 36.0
    No categories
     
    My bibliography  
     
    Export citation  
  45. Stefan Huber, Korbinian Moeller, Hans-Christoph Nuerk & Klaus Willmes (2013). A Computational Modeling Approach on Three‐Digit Number Processing. Topics in Cognitive Science 5 (2):317-334.score: 36.0
    Recent findings indicate that the constituting digits of multi-digit numbers are processed, decomposed into units, tens, and so on, rather than integrated into one entity. This is suggested by interfering effects of unit digit processing on two-digit number comparison. In the present study, we extended the computational model for two-digit number magnitude comparison of Moeller, Huber, Nuerk, and Willmes (2011a) to the case of three-digit number comparison (e.g., 371_826). In a second step, we evaluated how hundred-decade and hundred-unit compatibility (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. María J. O. Jiménez (2009). Design and Functions of Data Bases on Traditional Knowledge : The Case of Venezuela. In Evanson C. Kamau & Gerd Winter (eds.), Genetic Resources, Traditional Knowledge, and the Law Solutions for Access and Benefit Sharing. Earthscan.score: 36.0
    No categories
     
    My bibliography  
     
    Export citation  
  47. P. Boyd (2003). The Requirements of the Data Protection Act 1998 for the Processing of Medical Data. Journal of Medical Ethics 29 (1):34-35.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. H. E. Rose (1984). Subrecursion: Functions and Hierarchies. Oxford University Press.score: 36.0
    No categories
     
    My bibliography  
     
    Export citation  
  49. A. Schurmann (1971). Functions Computable by a Computer. Studia Logica 27 (1):57 - 72.score: 36.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  50. Mark Changizi (1996). Function Identification From Noisy Data with Recursive Error Bounds. Erkenntnis 45 (1):91 - 102.score: 35.0
    New success criteria of inductive inference in computational learning theory are introduced which model learning total (not necessarily recursive) functions with (possibly everywhere) imprecise theories from (possibly always) inaccurate data. It is proved that for any level of error allowable by the new success criteria, there exists a class of recursive functions such that not all f are identifiable via the criterion at that level of error. Also, necessary and sufficient conditions on the error level are given (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  51. L. M. Vaina (1990). What and Where in the Human Visual System: Two Hierarchies of Visual Modules. Synthese 83 (1):49-91.score: 34.0
    In this paper we focus on the modularity of visual functions in the human visual cortex, that is, the specific problems that the visual system must solve in order to achieve recognition of objects and visual space. The computational theory of early visual functions is briefly reviewed and is then used as a basis for suggesting computational constraints on the higher-level visual computations. The remainder of the paper presents neurological evidence for the existence of two visual systems in (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  52. Steven Pinker, 'S Reply to Ahouse & Berwick's Review of How the Mind Works.score: 34.0
    How the Mind Works is a synthesis of cognitive science and evolutionary biology that aims to explain the human mind with three ideas: (1) Computation: thinking and feeling consist of information-processing in the brain; (2) Specialization: the mind is not a single entity, but a complex system of parts designed to solve different problems; (3) Evolution: as with the organs of the body, our complex mental faculties have biological functions ultimately related to survival and reproduction. The book lays (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  53. Byeong-Ho Kang & Debbie Richards (eds.) (2010). Knowledge Management and Acquisition for Smart Systems and Services: 11th International Workshop, Pkaw 2010, Daegu, Korea, August 20 - September 3, 2010: Proceedings. [REVIEW] Springer.score: 34.0
    No categories
     
    My bibliography  
     
    Export citation  
  54. James Moor & Terrell Ward Bynum (eds.) (2002). Cyberphilosophy: The Intersection of Philosophy and Computing. Blackwell Pub..score: 31.0
    This cutting edge volume provides an overview of the dynamic new field of cyberphilosophy – the intersection of philosophy and computing.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  55. Aaron Sloman (1978). The Computer Revolution in Philosophy: Philosophy Science and Models of Mind. Harvester.score: 31.0
    Since 1991 the author has been Professor of Artificial Intelligence and Cognitive Science in the School of Computer Science at the University of Birmingham, UK.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  56. Terrell Ward Bynum & James Moor (eds.) (1998). The Digital Phoenix: How Computers Are Changing Philosophy. Blackwell Publishers.score: 31.0
    This important book, which results from a series of presentations at American Philosophical Association conferences, explores the major ways in which computers ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  57. Edward R. Griffor (ed.) (1999). Handbook of Computability Theory. Elsevier.score: 31.0
    The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  58. Giuseppe Primiero (2012). Offline and Online Data: On Upgrading Functional Information to Knowledge. Philosophical Studies 164 (2):371-392.score: 31.0
    This paper addresses the problem of upgrading functional information to knowledge. Functional information is defined as syntactically well-formed, meaningful and collectively opaque data. Its use in the formal epistemology of information theories is crucial to solve the debate on the veridical nature of information, and it represents the companion notion to standard strongly semantic information, defined as well-formed, meaningful and true data. The formal framework, on which the definitions are based, uses a contextual version of the verificationist principle (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  59. Douglas S. Robertson (2003). Phase Change: The Computer Revolution in Science and Mathematics. Oxford University Press.score: 31.0
    Robertson's earlier work, The New Renaissance projected the likely future impact of computers in changing our culture. Phase Change builds on and deepens his assessment of the role of the computer as a tool driving profound change by examining the role of computers in changing the face of the sciences and mathematics. He shows that paradigm shifts in understanding in science have generally been triggered by the availability of new tools, allowing the investigator a new way of seeing into questions (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  60. E. Börger (1989). Computability, Complexity, Logic. New York, N.Y., U.S.A.Elsevier Science Pub. Co..score: 31.0
    The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  61. S. B. Cooper & J. K. Truss (eds.) (1999). Models and Computability: Invited Papers From Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997. Cambridge University Press.score: 31.0
    Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  62. S. B. Cooper & Andrea Sorbi (eds.) (2011). Computability in Context: Computation and Logic in the Real World. World Scientific.score: 31.0
    Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  63. Ayda I. Arruda, Newton C. A. Costdaa & R. Chuaqui (eds.) (1977). Non-Classical Logics, Model Theory, and Computability: Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, Brazil, July 11-17, 1976. [REVIEW] Sale Distributors for the U.S.A. And Canada, Elsevier/North-Holland.score: 31.0
  64. Ralph Gregory Taylor (1998). Models of Computation and Formal Languages. Oxford University Press.score: 31.0
    This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation, and is the first book of its kind to include software. Accompanying software simulations of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on disk in a user-friendly format. Its applications to computer science (...)
     
    My bibliography  
     
    Export citation  
  65. George J. Tourlakis (2012). Theory of Computation. Wiley.score: 31.0
    In addition, this book contains tools that, in principle, can search a set of algorithms to see whether a problem is solvable, or more specifically, if it can be solved by an algorithm whose computations are efficient.
    Direct download  
     
    My bibliography  
     
    Export citation  
  66. Patrick Blackburn (2005). Representation and Inference for Natural Language: A First Course in Computational Semantics. Center for the Study of Language and Information.score: 31.0
    How can computers distinguish the coherent from the unintelligible, recognize new information in a sentence, or draw inferences from a natural language passage? Computational semantics is an exciting new field that seeks answers to these questions, and this volume is the first textbook wholly devoted to this growing subdiscipline. The book explains the underlying theoretical issues and fundamental techniques for computing semantic representations for fragments of natural language. This volume will be an essential text for computer scientists, linguists, and anyone (...)
     
    My bibliography  
     
    Export citation  
  67. Michael Stubbs (2001). Words and Phrases: Corpus Studies of Lexical Semantics. Blackwell Publishers.score: 30.0
    This book fills a gap in studies of meaning by providing detailed case studies of attested corpus data on the meanings of words and phrases.
    Direct download  
     
    My bibliography  
     
    Export citation  
  68. Eugene Charniak & Yorick Wilks (eds.) (1976). Computational Semantics: An Introduction to Artificial Intelligence and Natural Language Comprehension. Distributors for the U.S.A. And Canada, Elsevier/North Holland.score: 30.0
  69. Daniel E. Cohen (1987). Computability and Logic. Halsted Press.score: 30.0
  70. Patrick Lincoln (1995). Computational Aspects of Linear Logic. Mit Press.score: 30.0
     
    My bibliography  
     
    Export citation  
  71. Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.score: 30.0
    No categories
     
    My bibliography  
     
    Export citation  
  72. Jan van Bakel (1984). Automatic Semantic Interpretation: A Computer Model of Understanding Natural Language. Foris Publications.score: 30.0
  73. Eric Gerhardt Wagner (1963). Uniformly Reflexive Structures: Towards an Abstract Theory of Computability. S.N.].score: 30.0
     
    My bibliography  
     
    Export citation  
  74. Gordana Dodig Crnkovic & Mark Burgin (eds.) (forthcoming). INFORMATION AND COMPUTATION. World Scientific.score: 29.5
    The book focuses on relations between information and computation. Information is a basic structure of the world, while computation is a process of the dynamic change of information. In order for anything to exist for an individual, the individual must get information on it, either by means of perception or by re-organization of the existing information into new patterns and networks in the brain. With the advent of World Wide Web and a prospect of semantic web, the ways of information (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  75. Solomon Feferman, Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams.score: 29.0
    In this paper we specialize the notion of abstract computational procedure previously introduced for intensionally presented structures to those which are extensionally given. This is provided by a form of generalized recursion theory which uses schemata for explicit definition, conditional definition and least fixed point (LFP) recursion in functionals of type level ≤ 2 over any appropriate structure. It is applied here to the case of potentially infinite (and more general partial) streams as an abstract data type.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  76. Jan Doroszewski (1988). Ethical and Methodological Aspects of Medical Computer Data Bases and Knowledge Bases. Theoretical Medicine and Bioethics 9 (2).score: 29.0
    Ethical problems are related to computer data bases, containing data on individuals and groups of persons, as well as to computer knowledge bases, containing general rules and elements of expert systems.In the present essay the following conclusions are made regarding computer data bases: privacy, security, and confidentiality of medical computer data bases should be ensured. This duty should rest with physicians in hospitals. The principle of informed consent should be applied to gathering information which is to (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  77. Wilhelm Ott (2007). Digital Publishing: Tools and Products. Poiesis and Praxis 5 (2):81-112.score: 28.5
    Electronic publications are not accessible without technical aids and need constant, time consuming attention; a look back at the data media and data formats utilized in the past 25Â years illustrates this. Recently, an increasing number of conferences and studies address the problem. Use of standard data formats, media and platform independence of data, as well as data centering instead of process centering are requirements for long-term availability. For the humanities, texts are not only the (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  78. Chris Fox (2005). Foundations of Intensional Semantics. Blackwell Pub..score: 28.0
    This book provides a systematic study of three foundational issues in the semantics of natural language that have been relatively neglected in the past few decades. focuses on the formal characterization of intensions, the nature of an adequate type system for natural language semantics, and the formal power of the semantic representation language proposes a theory that offers a promising framework for developing a computational semantic system sufficiently expressive to capture the properties of natural language meaning while remaining computationally tractable (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  79. Andrew A. Fingelkurts & Alexander A. Fingelkurts (2011). Persistent Operational Synchrony Within Brain Default-Mode Network and Self-Processing Operations in Healthy Subjects. Brain and Cognition 75 (2):79-90.score: 28.0
    Based on the theoretical analysis of self-consciousness concepts, we hypothesized that the spatio-temporal pattern of functional connectivity within the default-mode network (DMN) should persist unchanged across a variety of different cognitive tasks or acts, thus being task-unrelated. This supposition is in contrast with current understanding that DMN activated when the subjects are resting and deactivated during any attention-demanding cognitive tasks. To test our proposal, we used, in retrospect, the results from our two early studies ([Fingelkurts, 1998] and [Fingelkurts et al., (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  80. Graeme Hirst (1987). Semantic Interpretation and the Resolution of Ambiguity. Cambridge University Press.score: 28.0
    In this particularly well written volume Graeme Hirst presents a theoretically motivated foundation for semantic interpretation (conceptual analysis) by computer, and shows how this framework facilitates the resolution of both lexical and syntactic ambiguities.
    Direct download  
     
    My bibliography  
     
    Export citation  
  81. Felix Engelmann, Shravan Vasishth, Ralf Engbert & Reinhold Kliegl (2013). A Framework for Modeling the Interaction of Syntactic Processing and Eye Movement Control. Topics in Cognitive Science 5 (2).score: 28.0
    We explore the interaction between oculomotor control and language comprehension on the sentence level using two well-tested computational accounts of parsing difficulty. Previous work (Boston, Hale, Vasishth, & Kliegl, 2011) has shown that surprisal (Hale, 2001; Levy, 2008) and cue-based memory retrieval (Lewis & Vasishth, 2005) are significant and complementary predictors of reading time in an eyetracking corpus. It remains an open question how the sentence processor interacts with oculomotor control. Using a simple linking hypothesis proposed in Reichle, Warren, and (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  82. N. Shankar (1994). Metamathematics, Machines, and Gödel's Proof. Cambridge University Press.score: 28.0
    The automatic verification of large parts of mathematics has been an aim of many mathematicians from Leibniz to Hilbert. While Gödel's first incompleteness theorem showed that no computer program could automatically prove certain true theorems in mathematics, the advent of electronic computers and sophisticated software means in practice there are many quite effective systems for automated reasoning that can be used for checking mathematical proofs. This book describes the use of a computer program to check the proofs of several celebrated (...)
     
    My bibliography  
     
    Export citation  
  83. Andreas Weiermann (2006). Classifying the Provably Total Functions of Pa. Bulletin of Symbolic Logic 12 (2):177-190.score: 27.5
    We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as well as seems possible the intrinsic computational character of the standard cut elimination process. The article is intended to be suitable for teaching purposes and just requires basic familiarity with PA and the ordinals below ε0. (Familiarity with a cut elimination theorem for a Gentzen or Tait calculus is helpful but not presupposed).
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  84. Georg Northoff (2008). Are Our Emotional Feelings Relational? A Neurophilosophical Investigation of the James–Lange Theory. Phenomenology and the Cognitive Sciences 7 (4).score: 27.0
    The James–Lange theory considers emotional feelings as perceptions of physiological body changes. This approach has recently resurfaced and modified in both neuroscientific and philosophical concepts of embodiment of emotional feelings. In addition to the body, the role of the environment in emotional feeling needs to be considered. I here claim that the environment has not merely an indirect and thus instrumental role on emotional feelings via the body and its sensorimotor and vegetative functions. Instead, the environment may have a (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  85. Sebo Uithol, Iris van Rooij, Harold Bekkering & Pim Haselager (2011). What Do Mirror Neurons Mirror? Philosophical Psychology 24 (5):607 - 623.score: 27.0
    Single cell recordings in monkeys provide strong evidence for an important role of the motor system in action understanding. This evidence is backed up by data from studies of the (human) mirror neuron system using neuroimaging or TMS techniques, and behavioral experiments. Although the data acquired from single cell recordings are generally considered to be robust, several debates have shown that the interpretation of these data is far from straightforward. We will show that research based on single-cell (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  86. David Pereplyotchik (2011). Psychological and Computational Models of Language Comprehension. Croatian Journal of Philosophy 11 (31):31-72.score: 27.0
    In this paper, I argue for a modified version of what Devitt (2006) calls the Representational Thesis (RT). According to RT, syntactic rules or principles are psychologically real, in the sense that they are represented in the mind/brain of every linguistically competent speaker/hearer. I present a range of behavioral and neurophysiological evidence for the claim that the human sentence processing mechanism constructs mental representations of the syntactic properties of linguistic stimuli. I then survey a range of psychologically plausible computational (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  87. Joaquín M. Fuster (2003). More Than Working Memory Rides on Long-Term Memory. Behavioral and Brain Sciences 26 (6):737-737.score: 27.0
    Single-unit data from the cortex of monkeys performing working-memory tasks support the main point of the target article. Those data, however, also indicate that the activation of long-term memory is essential to the processing of all cognitive functions. The activation of cortical long-term memory networks is a key neural mechanism in attention (working memory is a form thereof), perception, memory acquisition and retrieval, intelligence, and language.
    Direct download  
     
    My bibliography  
     
    Export citation  
  88. Ralph D. Ellis (2001). Implications of Inattentional Blindness for "Enactive" Theories of Consciousness. Brain and Mind 2 (3):297-322.score: 27.0
    Mack and Rock show evidence that no consciousperception occurs without a prior attentiveact. Subjects already executing attention taskstend to neglect visible elements extraneous tothe attentional task, apparently lacking evenbetter-than-chance ``implicit perception,''except in certain cases where the unattendedstimulus is a meaningful word or has uniquepre-tuned salience similar to that ofmeaningful words. This is highly consistentwith ``enactive'' notions that consciousnessrequires selective attention via emotional subcortical and limbic motivationalactivation as it influences anterior attentionmechanisms. Occipital activation withoutconsciousness suggests that motivated search,enacted through the organism's (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  89. Dimitris Repantis, Peter Schlattmann, Oona Laisney & Isabella Heuser (2008). Antidepressants for Neuroenhancement in Healthy Individuals: A Systematic Review. Poiesis and Praxis 6 (3-4):139-174.score: 27.0
    Neuroenhancement offers the prospect of improving the cognitive, emotional and motivational functions of healthy individuals. Of all the conceivable interventions, psychopharmacology provides the most readily available ones, such as antidepressants which are thought to make people better than well . However, up until now, whether they possess such an enhancing ability remains controversial and therefore in this systematic review we will evaluate the effect and safety of modern antidepressants in healthy individuals. A search of MEDLINE and EMBASE databases and (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  90. Steven Jones (2002). Antonymy: A Corpus Based Perspective. Routledge.score: 27.0
    Antonyms are a ubiquitous part of everyday language, and this book provides a detailed, comprehensive account of the phenomenon.This book demonstrates how ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  91. Elzbieta Szelag & Ernst Pöppel (2000). Temporal Perception: A Key to Understanding Language. Behavioral and Brain Sciences 23 (1):52-52.score: 27.0
    Although Grodzinsky's target article has merit, it neglects the importance of neural mechanisms underlying language functions. We present results from our clinical studies on different levels of temporal information processing in aphasic patients and briefly review the existing data on neurobiology of language to cast new light on the main thesis of the target article.
    Direct download  
     
    My bibliography  
     
    Export citation  
  92. Geoff Barnbrook, Pernilla Danielsson & Michaela Mahlberg (eds.) (2006). Meaningful Texts: The Extraction of Semantic Information From Monolingual and Multilingual Corpora. Continuum.score: 27.0
    This book reflects the growing influence of corpus linguistics in a variety of areas such as lexicography, translation studies, genre analysis, and language ...
    Direct download  
     
    My bibliography  
     
    Export citation  
  93. Vasco Brattka & Guido Gherardi (2011). Effective Choice and Boundedness Principles in Computable Analysis. Bulletin of Symbolic Logic 17 (1):73-117.score: 27.0
    In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  94. Michael A. Arbib & Péter Érdi (2000). Précis of Neural Organization: Structure, Function, and Dynamics. Behavioral and Brain Sciences 23 (4):513-533.score: 27.0
    Neural organization: Structure, function, and dynamics shows how theory and experiment can supplement each other in an integrated, evolving account of the brain's structure, function, and dynamics. (1) Structure: Studies of brain function and dynamics build on and contribute to an understanding of many brain regions, the neural circuits that constitute them, and their spatial relations. We emphasize Szentágothai's modular architectonics principle, but also stress the importance of the microcomplexes of cerebellar circuitry and the lamellae of hippocampus. (2) Function: Control (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  95. Petra Stoerig & Stephan Brandt (1993). The Visual System and Levels of Perception: Properties of Neuromental Organization. Theoretical Medicine and Bioethics 14 (2).score: 27.0
    To see whether the mental and the neural have common attributes that could resolve some of the traditional dichotomies, we review neuroscientific data on the visual system. The results show that neuronal and perceptual function share a parallel and hierarchical architecture which is manifest not only in the anatomy and physiology of the visual system, but also in normal perception and in the deficits caused by lesions in different parts of the system. Based on the description of parallel hierarchical (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  96. Amit Dubey, Frank Keller & Patrick Sturt (2013). Probabilistic Modeling of Discourse‐Aware Sentence Processing. Topics in Cognitive Science 5 (2).score: 27.0
    Probabilistic models of sentence comprehension are increasingly relevant to questions concerning human language processing. However, such models are often limited to syntactic factors. This restriction is unrealistic in light of experimental results suggesting interactions between syntax and other forms of linguistic information in human sentence processing. To address this limitation, this article introduces two sentence processing models that augment a syntactic component with information about discourse co-reference. The novel combination of probabilistic syntactic components with co-reference classifiers permits (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  97. Peter Beim Graben & Sabrina Gerth (2012). Geometric Representations for Minimalist Grammars. Journal of Logic, Language and Information 21 (4):393-432.score: 27.0
    We reformulate minimalist grammars as partial functions on term algebras for strings and trees. Using filler/role bindings and tensor product representations, we construct homomorphisms for these data structures into geometric vector spaces. We prove that the structure-building functions as well as simple processors for minimalist languages can be realized by piecewise linear operators in representation space. We also propose harmony, i.e. the distance of an intermediate processing step from the final well-formed state in representation space, as (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  98. Rosaleen A. McCarthy & E. K. Warrington (1999). Backtracking? Rehearsing and Replaying Some Old Arguments About Short-Term Memory. Behavioral and Brain Sciences 22 (1):107-108.score: 27.0
    We discuss the role of short-term auditory verbal storage within a working memory system. Data from single case studies of patients with left parietal lesions and selective impairment of memory span are discussed in order to address the question of the functions of short-term memory in language processing. The backup resource of auditory verbal short-term memory is required for those tasks that necessitate backtracking in order to integrate a verbal message within a developing central cognitive representation.
    Direct download  
     
    My bibliography  
     
    Export citation  
  99. Robert D. Oades & Hanna Christiansen (2005). ADHD Theories Still Need to Take More on Board: Serotonin and Pre-Executive Variability. Behavioral and Brain Sciences 28 (3):438-438.score: 27.0
    Correcting the relationship between tonic and burst firing modes in dopamine neurons may help normalise stimulus-reinforcement gradients and contingent behaviour in attention-deficit/hyperactivity disorder (ADHD) children. But appropriate evaluations of stimuli for developing adaptive plans and controlling impulsivity will not occur without moderating the gain-like functions of serotonin. The “dynamic theory” correctly highlights the need to account for variability in ADHD. The dysmaturation of pre-executive information processing is proposed as an explanation. At the core of the article by Sagvolden (...)
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 100 / 1000