|
Peptide Computing
Peptide computing is a form of computing which uses peptides, instead of traditional electronic components. The basis of this computational model is the affinity of antibodies towards peptide sequences. Similar to DNA computing, the parallel interactions of peptide sequences and antibodies have been used by this model to solve a few NP-complete problems. Specifically, the hamiltonian path problem (HPP) and some versions of the set cover problem are a few NP-complete problems which have been solved using this computational model so far. This model of computation has also been shown to be computationally universal (or Turing complete). This model of computation has some critical advantages over DNA computing. For instance, while DNA is made of four building blocks, peptides are made of twenty building blocks. The peptide-antibody interactions are also more flexible with respect to recognition and affinity than an interaction between a DNA strand and its reverse complement. However ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computing
Computing is any goal-oriented activity requiring, benefiting from, or creating computer, computing machinery. It includes the study and experimentation of algorithmic processes, and the development of both computer hardware, hardware and software. Computing has scientific, engineering, mathematical, technological, and social aspects. Major computing disciplines include computer engineering, computer science, cybersecurity, data science, information systems, information technology, and software engineering. The term ''computing'' is also synonymous with counting and calculation, calculating. In earlier times, it was used in reference to the action performed by Mechanical computer, mechanical computing machines, and before that, to Computer (occupation), human computers. History The history of computing is longer than the history of computing hardware and includes the history of methods intended for pen and paper (or for chalk and slate) with or without the aid of tables. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Biocomputers
Biological computers use biologically derived molecules — such as DNA and/or proteins — to perform digital or real computations. The development of biocomputers has been made possible by the expanding new science of nanobiotechnology. The term nanobiotechnology can be defined in multiple ways; in a more general sense, nanobiotechnology can be defined as any type of technology that uses both nano-scale materials (i.e. materials having characteristic dimensions of 1-100 nanometers) and biologically based materials. A more restrictive definition views nanobiotechnology more specifically as the design and engineering of proteins that can then be assembled into larger, functional structures The implementation of nanobiotechnology, as defined in this narrower sense, provides scientists with the ability to engineer biomolecular systems specifically so that they interact in a fashion that can ultimately result in the computational functionality of a computer. Scientific background B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Classes Of Computers
Computers can be classified, or typed, in many ways. Some common classifications of computers are given below. Classes by purpose , - , style="text-align: left;", Notes: Microcomputers (personal computers) Microcomputers became the most common type of computer in the late 20th century. The term "microcomputer" was introduced with the advent of systems based on single-chip microprocessors. The best-known early system was the Altair 8800, introduced in 1975. The term "microcomputer" has practically become an anachronism as it has fallen into disuse. These computers include: * Desktop computers – A case put under or on a desk. The display may be optional, depending on use. The case size may vary, depending on the required expansion slots. Very small computers of this kind may be integrated into the monitor. * Rackmount computers – The cases of these computers fit into 19-inch racks, and may be space-optimized and very flat. A dedicated display, keyboard, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Molecular Logic Gate
A molecular logic gate is a molecule that performs a logical operation based on at least one physical or chemical inputs and a single output. The field has advanced from simple logic systems based on a single chemical or physical input to molecules capable of combinatorial and sequential operations such as arithmetic operations (i.e. moleculators and memory storage algorithms). Molecular logic gates work with input signals based on chemical processes and with output signals based on spectroscopy, spectroscopic phenomena. Logic gates are the fundamental building blocks of computers, microcontrollers and other electrical circuits that require one or more logical operations. They can be used to construct digital architectures with varying degrees of complexity by a cascade of a few to several million logic gates, and are essentially physical devices that produce a singular binary output after performing logical operations based on Boolean functions on one or more binary inputs. The conc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unconventional Computing
Unconventional computing (also known as alternative computing or nonstandard computation) is computing by any of a wide range of new or unusual methods. The term ''unconventional computation'' was coined by Cristian S. Calude and John Casti and used at the First International Conference on Unconventional Models of Computation in 1998. Background The general theory of computation allows for a variety of methods of computation. Computing technology was first developed using mechanical systems and then evolved into the use of electronic devices. Other fields of modern physics provide additional avenues for development. Models of Computation A model of computation describes how the output of a mathematical function is computed given its input. The model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parallel Computing
Parallel computing is a type of computing, computation in which many calculations or Process (computing), processes are carried out simultaneously. Large problems can often be divided into smaller ones, which can then be solved at the same time. There are several different forms of parallel computing: Bit-level parallelism, bit-level, Instruction-level parallelism, instruction-level, Data parallelism, data, and task parallelism. Parallelism has long been employed in high-performance computing, but has gained broader interest due to the physical constraints preventing frequency scaling.S.V. Adve ''et al.'' (November 2008)"Parallel Computing Research at Illinois: The UPCRC Agenda" (PDF). Parallel@Illinois, University of Illinois at Urbana-Champaign. "The main techniques for these performance benefits—increased clock frequency and smarter but increasingly complex architectures—are now hitting the so-called power wall. The computer industry has accepted that future performance inc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Molecular Electronics
Molecular electronics is the study and application of molecular building blocks for the fabrication of electronic components. It is an interdisciplinary area that spans physics, chemistry, and materials science. It provides a potential means to extend Moore's Law beyond the foreseen limits of small-scale conventional silicon integrated circuits. Molecular scale electronics Molecular scale electronics, also called single-molecule electronics, is a branch of nanotechnology that uses single molecules, or nanoscale collections of single molecules, as electronic components. Because single molecules constitute the smallest stable structures possible, this miniaturization is the ultimate goal for shrinking electrical circuits. Conventional electronic devices are traditionally made from bulk materials. Bulk methods have inherent limits, and are growing increasingly demanding and costly. Thus, the idea was born that the components could instead be built up atom by atom in a chemistry ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Complexity Theory
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying their computational complexity, i.e., the amount of resources needed to solve them, such as time and storage. Other measures of complexity are also used, such as the amount of communication (used in communication complexity), the number of logic gate, gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). O ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Gene
A computational gene is a molecular automaton consisting of a structural part and a functional part; and its design is such that it might work in a cellular environment. The structural part is a naturally occurring gene, which is used as a skeleton to encode the input and the transitions of the automaton (Fig. 1A). The conserved features of a structural gene (e.g., DNA polymerase binding site, start and stop codons, and splicing sites) serve as constants of the computational gene, while the coding regions, the number of exons and introns, the position of start and stop codon, and the automata theoretical variables (symbols, states, and transitions) are the design parameters of the computational gene. The constants and the design parameters are linked by several logical and biochemical constraints (e.g., encoded automata theoretic variables must not be recognized as splicing junctions). The input of the automaton are molecular markers given by single stranded DNA (ssDNA) molecules. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monoclonal Antibodies
A monoclonal antibody (mAb, more rarely called moAb) is an antibody produced from a Lineage (evolution), cell lineage made by cloning a unique white blood cell. All subsequent antibodies derived this way trace back to a unique parent cell. Monoclonal antibodies are identical and can thus have Valence (chemistry), monovalent affinity, binding only to a particular epitope (the part of an antigen that is recognized by the antibody). In contrast, polyclonal antibodies are mixtures of antibodies derived from multiple plasma cell lineages which each bind to their particular target epitope. Artificial antibodies known as bispecific monoclonal antibodies can also be engineered which include two different antigen binding sites (Fragment antigen-binding region, FABs) on the same antibody. It is possible to produce monoclonal antibodies that specifically bind to almost any suitable substance; they can then serve to detect or purify it. This capability has become an investigative tool in b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Peptide
Peptides are short chains of amino acids linked by peptide bonds. A polypeptide is a longer, continuous, unbranched peptide chain. Polypeptides that have a molecular mass of 10,000 Da or more are called proteins. Chains of fewer than twenty amino acids are called oligopeptides, and include dipeptides, tripeptides, and tetrapeptides. Peptides fall under the broad chemical classes of biological polymers and oligomers, alongside nucleic acids, oligosaccharides, polysaccharides, and others. Proteins consist of one or more polypeptides arranged in a biologically functional way, often bound to ligands such as coenzymes and cofactors, to another protein or other macromolecule such as DNA or RNA, or to complex macromolecular assemblies. Amino acids that have been incorporated into peptides are termed residues. A water molecule is released during formation of each amide bond.. All peptides except cyclic peptides have an N-terminal (amine group) and C-terminal (carboxyl g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing Completeness
In computability theory, a system of data-manipulation rules (such as a model of computation, a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing). This means that this system is able to recognize or decode other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete. A related concept is that of Turing equivalence two computers P and Q are called equivalent if P can simulate Q and Q can simulate P. The Church–Turing thesis conjectures that any function whose values can be computed by an algorithm can be computed by a Turing machine, and therefore that if any real-world computer can simulate a Turing machine, it is Turing equivalent to a Turing m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
