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
    Direct download  
     
    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. Manuel L. Campagnolo & Kerry Ojakian (2008). The Elementary Computable Functions Over the Real Numbers: Applying Two New Techniques. [REVIEW] Archive for Mathematical Logic 46 (7-8):593-627.score: 78.0
    The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Hagen Lindstädt (2001). More Nonconcavities in Information Processing Functions. Theory and Decision 51 (2/4):351-365.score: 73.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 (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Joost J. Joosten (2010). Consistency Statements and Iterations of Computable Functions in IΣ1 and PRA. Archive for Mathematical Logic 49 (7-8):773-798.score: 70.5
    In this paper we will state and prove some comparative theorems concerning PRA and IΣ1. We shall provide a characterization of IΣ1 in terms of PRA and iterations of a class of functions. In particular, we prove that for this class of functions the difference between IΣ1 and PRA is exactly that, where PRA is closed under iterations of these functions, IΣ1 is moreover provably closed under iteration. We will formulate a sufficient condition for a model of (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. M. Patharkar (2011). From Data Processing to Mental Organs: An Interdisciplinary Path to Cognitive Neuroscience. Mens Sana Monographs 9 (1):218.score: 68.0
    Human brain is a highly evolved coordinating mechanism in the species Homo sapiens. It is only in the last 100 years that extensive knowledge of the intricate structure and complex functioning of the human brain has been acquired, though a lot is yet to be known. However, from the beginning of civilisation, people have been conscious of a 'mind' which has been considered the origin of all scientific and cultural development. Philosophers have discussed at length the various attributes of consciousness. (...)
    No categories
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  8. 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  
  9. Ning Zhong (1998). Derivatives of Computable Functions. Mathematical Logic Quarterly 44 (3):304-316.score: 64.5
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. H. Richard Blackwell (1952). The Influence of Data Collection Procedures Upon Psychophysical Measurement of Two Sensory Functions. Journal of Experimental Psychology 44 (5):306.score: 60.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Marcus Cheetham, Ivana Pavlovic, Nicola Jordan, Pascal Suter & Lutz Jancke (2013). Category Processing and the Human Likeness Dimension of the Uncanny Valley Hypothesis: Eye-Tracking Data. Frontiers in Psychology 4.score: 60.0
    The Uncanny Valley Hypothesis (Mori, 1970) predicts that perceptual difficulty distinguishing between a humanlike object (e.g., lifelike prosthetic hand, mannequin) and its human counterpart evokes negative affect. Research has focussed on affect, with inconsistent results, but little is known about how objects along the hypothesis’ dimension of human likeness (DHL) are actually perceived. This study used morph continua based on human and highly realistic computer-generated (avatar) faces to represent the DHL. Total number and dwell time of fixations to facial features (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Timothy H. McNicholl (2008). Uniformly Computable Aspects of Inner Functions: Estimation and Factorization. Mathematical Logic Quarterly 54 (5):508-518.score: 60.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. Colin Beardon (1994). Computers, Postmodernism and the Culture of the Artificial. AI and Society 8 (1):1-16.score: 58.8
    The term ‘the artificial’ can only be given a precise meaning in the context of the evolution of computational technology and this in turn can only be fully understood within a cultural setting that includes an epistemological perspective. The argument is illustrated in two case studies from the history of computational machinery: the first calculating machines and the first programmable computers. In the early years of electronic computers, the dominant form of computing was data processing which was a (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. Judy M. Myerson (1991). Book Review: English-Japanese, Japanese-English Dictionary of Computer and Data Processing Terms by George Ferber (MIT Press 1989). [REVIEW] Acm Sigcas Computers and Society 21 (2-4):51.score: 57.3
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Judy M. Reviewer-Myerson (1991). Book Review: English-Japanese, Japanese-English Dictionary of Computer and Data Processing Terms by George Ferber (MIT Press 1989). [REVIEW] Acm Sigcas Computers and Society 21 (2-4):51.score: 57.3
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  16. Grigori Mints (1994). Logic and Computer Science, Edited by Odifreddi Piergiorgio, APIC Studies in Data Processing, Vol. 31, Academic Press, London, San Diego, Etc., 1990, Xii+ 430 Pp. [REVIEW] Journal of Symbolic Logic 59 (3):1111-1114.score: 55.5
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. 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).
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  18. Philipp Ruhnau, Björn Herrmann, Burkhard Maess, Jens Brauer, Angela Dorkas Friederici & Erich Schröger (2013). Processing of Complex Distracting Sounds in School-Aged Children and Adults: Evidence From EEG and MEG Data. Frontiers in Psychology 4.score: 54.0
    When a perceiver performs a task, rarely occurring sounds often have a distracting effect on task performance. The neural mismatch responses in event-related potentials to such distracting stimuli depend on age. Adults commonly show a negative response, whereas in children a positive as well as a negative mismatch response has been reported. Using electro- and magnetoencephalography (EEG/MEG), here we investigated the developmental changes of distraction processing in school-aged children (9–10 years) and adults. Participants took part in an auditory-visual distraction (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. 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 (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Erik Andersson (ed.) (1978). Working Papers on Computer Processing of Syntactic Data. Research Institute, Åbo Akademi Foundation.score: 53.0
     
    My bibliography  
     
    Export citation  
  21. 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  
  22. Marian B. Pour‐El & Ning Zhong (1997). The Wave Equation with Computable Initial Data Whose Unique Solution is Nowhere Computable. Mathematical Logic Quarterly 43 (4):499-509.score: 52.5
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  23. 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  
  24. Asher M. Kach & Daniel Turetsky (2010). Limitwise Monotonic Functions, Sets, and Degrees on Computable Domains. Journal of Symbolic Logic 75 (1):131-154.score: 50.0
    We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increasing) limitwise monotonic on various computable domains. As applications, we provide a characterization of the sets S with computable increasing η-representations using support increasing limitwise monotonic sets on ${\Bbb Q}$ and note relationships between the class of order-computable sets and the class of support increasing (support strictly increasing) limitwise monotonic sets (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Rodney G. Downey & Asher M. Kach (2010). Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52 (2):163-172.score: 50.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 (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Stefano Mazzanti (1997). Iterative Characterizations of Computable Unary Functions: A General Method. Mathematical Logic Quarterly 43 (1):29-38.score: 49.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  27. Qing Zhou (1996). Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space. Mathematical Logic Quarterly 42 (1):379-409.score: 49.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. 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 (12 more)  
     
    My bibliography  
     
    Export citation  
  29. E. F. Bradley & O. T. Denmead (eds.) (1967). The Collection and Processing of Field Data. New York, Interscience Publishers.score: 48.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. Manuel Lerman & Richard Watnick (2003). Computable Choice Functions for Computable Linear Orderings. Mathematical Logic Quarterly 49 (5):485-510.score: 48.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Nir Fresco & Marty J. Wolf (2014). The Instructional Information Processing Account of Digital Computation. Synthese 191 (7):1469-1492.score: 47.0
    What is nontrivial digital computation? It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accords with the common intuition that digital computation is a type of information processing. We use the notion of reachability in a graph to defend this characterization in memory-based systems and underscore the importance of (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  32. Iraj Kalantari & Larry Welch (2013). When Series of Computable Functions with Varying Domains Are Computable. Mathematical Logic Quarterly 59 (6):471-493.score: 46.5
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  33. Brigitte Krenn (2000). The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations. Dfki.score: 46.0
     
    My bibliography  
     
    Export citation  
  34. Thomas Lorscheid (1983). Evoked Potential Correlates of Semantic Word Processing. Hochschulverlag.score: 46.0
     
    My bibliography  
     
    Export citation  
  35. Anne-Lise Giraud Benjamin Morillon, Catherine Liégeois-Chauvel, Luc H. Arnal, Christian-G. Bénar (2012). Asymmetric Function of Theta and Gamma Activity in Syllable Processing: An Intra-Cortical Study. Frontiers in Psychology 3.score: 45.0
    Low-gamma (25-45 Hz) and theta (4-8 Hz) oscillations are proposed to underpin the integration of phonemic and syllabic information, respectively. How these two scales of analysis split functions across hemispheres is unclear. We analyzed cortical responses from an epileptic patient with a rare bilateral electrode implantation (stereotactic EEG) in primary (A1/BA41 and A2/BA42) and association auditory cortices (BA22). Using time-frequency analyses, we confirmed the dominance of a 5-6 Hz theta activity in right and of a low-gamma (25-45 Hz) activity (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  36. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.score: 45.0
  37. T. Siva Tian (2010). Functional Data Analysis in Brain Imaging Studies. Frontiers in Psychology 1:35-35.score: 45.0
    Functional data analysis (FDA) considers the continuity of the curves or functions, and is a topic of increasing interest in the statistics community. FDA is commonly applied to time-series and spatial-series studies. The development of functional brain imaging techniques in recent years made it possible to study the relationship between brain and mind over time. Consequently, an enormous amount of functional data is collected and needs to be analyzed. Functional techniques designed for these data are in (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Richard Stevenson & Tuki Attuquayefio (2013). Human Olfactory Consciousness and Cognition: Its Unusual Features May Not Result From Unusual Functions but From Limited Neocortical Processing Resources. Frontiers in Psychology 4.score: 44.0
    Human and animal olfactory perception is shaped both by functional demands and by various environmental constraints seemingly peculiar to chemical stimuli. These demands and constraints may have generated a sensory system that is cognitively distinct from the major senses. In this article we identify these various functional demands and constraints, and examine whether they can be used to account for olfaction’s unique cognitive features on a case-by-case basis. We then use this as grounds to argue that specific conscious processes do (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  39. Nachum Dershowitz & Yuri Gurevich (2008). A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14 (3):299-350.score: 43.5
    Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  40. 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  
  41. 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  
  42. George E. Briggs & James M. Swanson (1970). Encoding, Decoding, and Central Functions in Human Information Processing. Journal of Experimental Psychology 86 (2):296.score: 42.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  43. D. Kunkle (2004). Type-2 Computability on Spaces of Integrables Functions. Mathematical Logic Quarterly 50 (4):417.score: 42.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. Andrés Cordón–Franco & F. Félix Lara–Martín (2012). Local Induction and Provably Total Computable Functions: A Case Study. In. In S. Barry Cooper (ed.), How the World Computes. 440--449.score: 41.5
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. Arthur E. Parry (1983). Data Processing Risk. Acm Sigcas Computers and Society 13 (3):14-18.score: 41.5
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Shanshan Gu Wu & Yanfei Yu Lv (2006). Workshop on Web-Based Massive Data Processing-Session 1-Streaming Data-Modelling and Guaranteeing Quality of Service Over Data Streams. In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer-Verlag. 13-24.score: 41.5
    No categories
     
    My bibliography  
     
    Export citation  
  47. Min Li Yu & Longbo Zhang (2006). Workshop on Web-Based Massive Data Processing-Session 3-Massive Data Systems-Supporting Complex Query with Structured Overlays in Schema-Based P2P System. [REVIEW] In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer-Verlag. 115-121.score: 41.5
    No categories
     
    My bibliography  
     
    Export citation  
  48. 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  
  49. 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 (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  50. Samuel Alexander (2006). Formulas for Computable and Non-Computable Functions. Rose-Hulman Undergraduate Mathematics Journal 7 (2).score: 40.5
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000