Function (mathematics)
•
Theory of computation
•
Computability theory
Computable function
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithm. They are used to discuss computabili...
Algorithm
•
Formal languages
•
Church-Turing thesis
•
List of undecidable problems
Can You Solve The '100 Hat Riddle' Used By Google In Job Interviews?
A riddle used during job interviews for Google has proven to be no problem for artificial intelligence. A team from the University of Oxford, Canadian Institute for Advanced Research and Google’s D...
Algorithm Solves Graph Isomorphism In Record Time
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. A theoretical computer scientist has presented an algorithm that is being hailed as a brea...
Faster Optimization
Optimization problems are everywhere in engineering: Balancing design tradeoffs is an optimization problem, as are scheduling and logistical planning. The theory — and sometimes the implementation — o...
An algorithm can predict human behavior better than humans
You might presume, or at least hope, that humans are better at understanding fellow humans than machines are. But a new MIT study suggests an algorithm can predict someone's behavior faster and more r...
MIT Has Produced Data Science Machine That Is Replacing Human Intution For Big-Data Analysis
System that replaces human intuition with algorithms outperforms 615 of 906 human teams. Big-data analysis consists of searching for buried patterns that have some kind of predictive power. But choosi...
Researchers Develop Novel Theoretical Approach To Reduce Antibiotic Resistance
It is estimated that each year in the United States 2 million people become infected with bacteria that are resistant to one or more types of antibiotics, and at least 23,000 people will die because ...
'Psychic Robot' Will Know What You Really Meant To Do
Bioengineers at the University of Illinois at Chicago have developed a mathematical algorithm that can 'see' your intention while performing an ordinary action like reaching for a cup or driving strai...
Facebook Fights YouTube With Big Data On What You Watch Unmuted, Full-Screen
Facebook wants to become your favorite Internet TV by tracking what a television never could. Today it announced a News Feed algorithm change that will show you more videos similar to ones you expand ...
Data Scientists Find Connections Between Birth Month And Health
Columbia University scientists have developed a computational method to investigate the relationship between birth month and disease risk. The researchers used this algorithm to examine New York City ...
A data genius computes the ultimate American road trip
Calculating the fastest way to drive between all 50 landmarks – 2,500 individual routes – could theoretically take forever by hand, but Olson used the same genetic algorithm he used to find a search p...
Algorithm
This particular audibilization is just one of many ways to generate sound from running sorting algorithms. Here on every comparison of two numbers (elements)...
Algorithm
In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ AL-gə-ri-dhəm) is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data proc...
Algorithm - Wikipedia
Formal languages
In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols that may be constrained by rules that are specific to it.The alphabet of a formal language is the se...
Church-Turing thesis
In computability theory, the Church–Turing thesis (also known as the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis ("t...
List of undecidable problems
In computability theory, an undecidable problem is of a type of calculation which requires a yes/no answer, but where there can not possibly be any computer program that always gives the correct answe...
Can You Solve The '100 Hat Riddle' Used By Google In Job Interviews?
A riddle used during job interviews for Google has proven to be no problem for artificial intelligence. A team from the University of Oxford, Canadian Institute for Advanced Research and Google’s D...
Chandra-Toueg consensus algorithm
The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving consensus in a network of unreliable processes equipped with an eventually ...
Bzip2
bzip2 is a free and open-source file compression program that uses the Burrows–Wheeler algorithm. It only compresses single files and is not a file archiver. It is developed and maintained by Julian S...
Bzip2 - Wikipedia
Simulation Algorithms for Atomic DEVS
Given an atomic DEVS model, simulation algorithms are methods to generate the model's legal behaviors which are trajectories not to reach to illegal states. (see Behavior of DEVS). [Zeigler84] origina...
Simulation Algorithms for Atomic DEVS - Wikipedia
COmponent Detection Algorithm
The COmponent Detection Algorithm (CODA) is a name for a type of LC-MS and chemometrics software algorithm focused on detecting peaks in noisy chromatograms (TIC) often obtained using the electospray ...
Computational auditory scene analysis
Computational auditory scene analysis (CASA) is the study of auditory scene analysis by computational means. In essence, CASA systems are "machine listening" systems that aim to separate mixtures of s...
Distributed minimum spanning tree
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is rad...
Distributed minimum spanning tree - Wikipedia
Brute-force search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique that consists of systematically enumerating all possible cand...
Ellipsoid method
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions. When specialized to solving feasible linear optimization problems with rational data, the ell...
Ellipsoid method - Wikipedia
FEE method
In mathematics, the FEE method is the method of fast summation of series of a special form. It was constructed in 1990 by E. A. Karatsuba and was called FEE—Fast E-function Evaluation—because it make...
C-Link
C-Link - Wikipedia
Feature detection (computer vision)
In computer vision and image processing the concept of feature detection refers to methods that aim at computing abstractions of image information and making local decisions at every image point wheth...
Dual EC DRBG
Dual Elliptic Curve Deterministic Random Bit Generator (Dual_EC_DRBG) is an algorithm from the branch of cryptography known as elliptic curve cryptography that implements a cryptographically secure ps...
Bin (computational geometry)
In computational geometry, the bin data structure allows efficient region queries, i.e., if there are some axis-aligned rectangles on a 2D plane, answer the question Given a query rectangle, return al...
Bin (computational geometry) - Wikipedia
Atropos scheduler
In computer science, Atropos is a real-time scheduling algorithm developed at Cambridge University. It combines the earliest deadline first algorithm with a best effort scheduler to make use of slack ...