Free Computational Complexity Essays and Papers

Page 1 of 22 - About 215 essays
  • A Mathematical Analysis of Computational Complexity

    2720 Words  | 11 Pages

    polynomially, we built a new path to understand computational complexity questions and in future works, we will establish more bounds in complexity questions. A precise definition of {em algorithm} was given by Alan Turing in 1937 (see cite{AT1937}). A natural question arises: {em What is the computational difficult to perform some algorithm?} See, in chronological order, cite{RMO1959}, cite{RMO1960}, cite{HS1965} and others. Classification of complexity are find in cite{M87}. Our aims are to to open

  • Computational Complexity and the Origin of Universals

    5137 Words  | 21 Pages

    Computational Complexity and the Origin of Universals ABSTRACT: This paper establishes close relationships between fundamental problems in the philosophical and mathematical theories of mind. It reviews the mathematical concepts of intelligence, including pattern recognition algorithms, neural networks and rule systems. Mathematical difficulties manifest as combinatorial complexity of algorithms are related to the roles of a priori knowledge and adaptive learning, the same issues that have shaped

  • Computational Complexity and Philosophical Dualism

    3243 Words  | 13 Pages

    Computational Complexity and Philosophical Dualism ABSTRACT: I examine some recent controversies involving the possibility of mechanical simulation of mathematical intuition. The first part is concerned with a presentation of the Lucas-Penrose position and recapitulates some basic logical conceptual machinery (Gödel's proof, Hilbert's Tenth Problem and Turing's Halting Problem). The second part is devoted to a presentation of the main outlines of Complexity Theory as well as to the introduction

  • Increasing Size Of Data Size

    1023 Words  | 5 Pages

    Over the last so many years, a large amount of data has become available like a large amount of collections of photos, genetic information, and network traffic statistics, modern technologies and cheap storage facilities have made it possible to collect huge datasets. But can we effectively use all this data? The ever increasing sizes of the datasets make it imperative to design new algorithms capable of shifting through this data with extreme efficiency. Figure 1.1 The challenges include

  • Enhancements of the software for Time Performance Analysis of Recursive Algorithms

    830 Words  | 4 Pages

    Introduction Algorithm analysis plays a crucial role in broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm that solves a given computational problem. Algorithm analysis provides an insight into reasonable directions of search for efficient algorithms. It can be used in practice to choose an efficient algorithm which leads to better performance. Analyzing the efficiency of an algorithm is done by calculating the amount of computing

  • COP 3530, Discrete Data Structures and Algorithms, Summer 1999, Homework 1

    1173 Words  | 5 Pages

    Class Notes: Data Structures and Algorithms Summer-C Semester 1999 - M WRF 2nd Period CSE/E119, Section 7344 Homework #1 -- Solutions (in blue type) Note: There have been many questions about this homework assignment. Thus, clarifications are posted below in red type. When you answer these questions, bear in mind that each one only counts four points out of 1000 total points for the course. Thus, each one should have a concise answer. No need to write a dissertation. * Question 1. Suppose

  • Application for Master Degree in Theory and Computational Science

    957 Words  | 4 Pages

    also indispensable. As I move ahead in the future, I strongly desire for a program that would help me build a comprehensive foundation in the field of Computer Science. Within this field, I have developed a deep interest in the area of Theory and Computational Science. More specifically I find algorithms and theory of computation the most appealing areas due to their application in solving many real world problems. My undergraduate course in the field of Electronics Engineering has given me a comprehensive

  • What Are The Advantages And Disadvantages Of Computer Assisted Language Learning

    1284 Words  | 6 Pages

    Introduction Since the last few decades, exercising the skills of spoken language has been receiving high degree of attention amongst the educators. The curricula of foreign language creates the main focus on the skills of productivity by laying special emphasis over the competence of communication. Since recent times, there have been advancements within the multimedia technology that has resulted in the emergence of computer assisted language learning as a tempting option towards traditional sources

  • The Chemistry Nobel Prize 2013

    1633 Words  | 7 Pages

    For what work (research) was the prize awarded? Chemistry is one of category of Nobel Prize given to chemists who have dedicated in chemistry science. For a chemist, Nobel Prize is one of most prestigious award. Nobel Prize for chemistry 2013 has been decided, chemistry prize goes to three theoretical chemists who have developed a multiscale computer model to predict complex chemical reaction. For some people, maybe it the Chemistry Nobel Prize 2013 decision was a surprise. The Prize did not go to

  • Molecular Docking In Molecular Docking

    1925 Words  | 8 Pages

    Molecular docking is a key tool in structural molecular biology and computer-assisted drug design. The goal of ligand—protein docking is to predict the predominant binding mode(s) of a ligand with a protein of known three-dimensional structure. Successful docking methods search high-dimensional spaces effectively and use a scoring function that correctly ranks candidate dockings. Garrett M. Morris and Marguerita Lim-Wilby, Molecular Docking, In Molecular Modeling of Proteins Methods in Molecular