Topic: Computer science (Page 10)

You are looking at all articles with the topic "Computer science". We found 136 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

πŸ”— SCOOP: Simple Concurrent Object Oriented Programming

πŸ”— Computing πŸ”— Computer science

SCOOP (Simple Concurrent Object Oriented Programming) is a concurrency model designed for the Eiffel programming language, conceived by Eiffel's creator and designer, Bertrand Meyer.

SCOOP defines a way for an object oriented program to be written without the concept of threads, locks, or other typical multiprogramming methods. This allows the compiler or runtime environment to optimize the amount of concurrency as well as eliminate typical design flaws such as deadlock.

The model was first designed in the early 1990s and published in 1993 in the Communications of the ACM An updated version was described in chapter 30 of the book Object-Oriented Software Construction. A prototype implementation was developed in 1995 by Eiffel Software. An article by Compton and Walker provides an overview of SCOOP and describes another early implementation. Nienaltowski, Arslan and Meyer have published a description of the model as of 2003. Work on SCOOP proceeded at the Chair of Software Engineering at ETH Zurich. SCOOP became available as a standard part of EiffelStudio early in 2011.

πŸ”— Effective Accelerationism

πŸ”— Computer science πŸ”— Disaster management πŸ”— Philosophy πŸ”— Cognitive science πŸ”— Futures studies πŸ”— Effective Altruism

Effective accelerationism, often abbreviated as "e/acc", is a 21st-century philosophical movement advocating an explicit pro-technology stance. Its proponents believe that artificial intelligence-driven progress is a great social equalizer which should be pushed forward. They see themselves as a counterweight to the cautious view that AI is highly unpredictable and needs to be regulated, often giving their opponents the derogatory labels of "doomers" or "decels" (short for deceleration).

Central to effective accelerationism is the belief that propelling technological progress at any cost is the only ethically justifiable course of action. The movement carries utopian undertones and argues that humans need to develop and build faster to ensure their survival and propagate consciousness throughout the universe.

Although effective accelerationism has been described as a fringe movement, it has gained mainstream visibility. A number of high-profile Silicon Valley figures, including investors Marc Andreessen and Garry Tan, explicitly endorsed the movement by adding "e/acc" to their public social media profiles. Yann LeCun and Andrew Ng are seen as further supporters, as they have argued for less restrictive AI regulation.

Discussed on

πŸ”— Comb Sort - Just As Good As Quick Sort

πŸ”— Computing πŸ”— Computer science πŸ”— Computing/Software πŸ”— Computing/Computer science

Comb sort is a relatively simple sorting algorithm originally designed by WΕ‚odzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort.

Discussed on

πŸ”— OpenSSI is an open-source single-system image clustering system

πŸ”— Computing πŸ”— Computer science πŸ”— Computing/Software πŸ”— Computing/Free and open-source software πŸ”— Linux

OpenSSI is an open-source single-system image clustering system. It allows a collection of computers to be treated as one large system, allowing applications running on any one machine access to the resources of all the machines in the cluster.

OpenSSI is based on the Linux operating system and was released as an open source project by Compaq in 2001. It is the final stage of a long process of development, stretching back to LOCUS, developed in the early 1980s.

Discussed on

πŸ”— Claude Shannon

πŸ”— United States πŸ”— Biography πŸ”— Computer science πŸ”— Telecommunications πŸ”— Systems πŸ”— Biography/science and academia πŸ”— Cryptography πŸ”— Cryptography/Computer science πŸ”— Electronics πŸ”— Systems/Systems theory πŸ”— Telecommunications/Bell System πŸ”— Cycling

Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, and cryptographer known as "the father of information theory". Shannon is noted for having founded information theory with a landmark paper, "A Mathematical Theory of Communication", that he published in 1948.

He is also well known for founding digital circuit design theory in 1937, whenβ€”as a 21-year-old master's degree student at the Massachusetts Institute of Technology (MIT)β€”he wrote his thesis demonstrating that electrical applications of Boolean algebra could construct any logical numerical relationship. Shannon contributed to the field of cryptanalysis for national defense during World War II, including his fundamental work on codebreaking and secure telecommunications.

Discussed on

πŸ”— Comparison of parser generators

πŸ”— Computing πŸ”— Computer science πŸ”— Computing/Software

This is a list of notable lexer generators and parser generators for various language classes.

Discussed on

πŸ”— Note G

πŸ”— Computing πŸ”— Computer science

Note G was a computer algorithm written by Ada Lovelace, and was designed to calculate Bernoulli numbers using the hypothetical analytical engine. Note G is generally agreed to be the first algorithm specifically for a computer, and Lovelace is considered as the first computer programmer as a result. The algorithm was the last note in a series labelled A to G, which she employed as visual aids to accompany her English translation of Luigi Menabrea's 1842 French transcription of Charles Babbage's lecture on the analytical engine at the University of Turin, "Notions sur la machine analytique de Charles Babbage" ("Elements of Charles Babbage’s Analytical Machine"). Lovelace's Note G was never tested, as the engine was never built. Her notes, along with her translation, were published in 1843.

In the modern era, thanks to more readily available computing equipment and programming resources, Lovelace's algorithm has since been tested, after being "translated" into modern programming languages. These tests have independently concluded that there was a bug in the script, due to a minor typographical error, rendering the algorithm in its original state unusable.

Discussed on

πŸ”— Cuckoo hashing

πŸ”— Computer science

Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup time. The name derives from the behavior of some species of cuckoo, where the cuckoo chick pushes the other eggs or young out of the nest when it hatches; analogously, inserting a new key into a cuckoo hashing table may push an older key to a different location in the table.

Discussed on

πŸ”— Possible explanations for the slow progress of AI research

πŸ”— Computing πŸ”— Computer science πŸ”— Science Fiction πŸ”— Cognitive science πŸ”— Robotics πŸ”— Transhumanism πŸ”— Software πŸ”— Software/Computing πŸ”— Futures studies

Artificial general intelligence (AGI) is the hypothetical intelligence of a machine that has the capacity to understand or learn any intellectual task that a human being can. It is a primary goal of some artificial intelligence research and a common topic in science fiction and futures studies. AGI can also be referred to as strong AI, full AI, or general intelligent action. (Some academic sources reserve the term "strong AI" for machines that can experience consciousness.)

Some authorities emphasize a distinction between strong AI and applied AI (also called narrow AI or weak AI): the use of software to study or accomplish specific problem solving or reasoning tasks. Weak AI, in contrast to strong AI, does not attempt to perform the full range of human cognitive abilities.

As of 2017, over forty organizations were doing research on AGI.

Discussed on