Topic: Computing (Page 34)

You are looking at all articles with the topic "Computing". We found 481 matches.

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

πŸ”— 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

πŸ”— Hacker's Delight

πŸ”— Computing πŸ”— Books

Hacker's Delight is a software algorithm book by Henry S. Warren, Jr. first published in 2002. It presents fast bit-level and low-level arithmetic algorithms for common tasks such as counting bits or improving speed of division by using multiplication.

Discussed on

πŸ”— OpenMusic: visual programming env for musical composition based on Common Lisp

πŸ”— Computing


OpenMusic (OM) is an object-oriented visual programming environment for musical composition based on Common Lisp. It may also be used as an all-purpose visual interface to Lisp programming. At a more specialized level, a set of provided classes and libraries make it a very convenient environment for music composition.

πŸ”— OpenDoc

πŸ”— Apple Inc./Macintosh πŸ”— Apple Inc. πŸ”— Computing πŸ”— Computing/Software

OpenDoc is a multi-platform software componentry framework standard created by Apple for compound documents, intended as an alternative to Microsoft's Object Linking and Embedding (OLE). As part of the AIM alliance between Apple, IBM, and Motorola, OpenDoc is one of Apple's earliest experiments with open standards and collaborative development methods with other companiesβ€”effectively starting an industry consortium. Active development was discontinued in March 1997.

The core idea of OpenDoc is to create small, reusable components, responsible for a specific task, such as text editing, bitmap editing, or browsing an FTP server. OpenDoc provides a framework in which these components can run together, and a document format for storing the data created by each component. These documents can then be opened on other machines, where the OpenDoc frameworks substitute suitable components for each part, even if they are from different vendors. In this way users can "build up" their documents from parts. Since there is no main application and the only visible interface is the document itself, the system is known as document centered.

At its inception, it was envisioned that OpenDoc would allow smaller, third-party developers to enter the then-competitive office software market, able to build one good editor instead of having to provide a complete suite.

Discussed on

πŸ”— Principle of Least Astonishment

πŸ”— Computing πŸ”— Philosophy

The principle of least astonishment (POLA), also called the principle of least surprise (alternatively a "law" or "rule") applies to user interface and software design. A typical formulation of the principle, from 1984, is: "If a necessary feature has a high astonishment factor, it may be necessary to redesign the feature."

More generally, the principle means that a component of a system should behave in a way that most users will expect it to behave; the behavior should not astonish or surprise users.

Discussed on

πŸ”— Perl 6 new regexp rules

πŸ”— Computing πŸ”— Perl

Raku rules are the regular expression, string matching and general-purpose parsing facility of Raku, and are a core part of the language. Since Perl's pattern-matching constructs have exceeded the capabilities of formal regular expressions for some time, Raku documentation refers to them exclusively as regexes, distancing the term from the formal definition.

Raku provides a superset of Perl 5 features with respect to regexes, folding them into a larger framework called rules, which provide the capabilities of a parsing expression grammar, as well as acting as a closure with respect to their lexical scope. Rules are introduced with the rule keyword, which has a usage quite similar to subroutine definitions. Anonymous rules can be introduced with the regex (or rx) keyword, or simply be used inline as regexes were in Perl 5 via the m (matching) or s (substitution) operators.

Discussed on

πŸ”— JScript

πŸ”— Computing πŸ”— Microsoft Windows πŸ”— Microsoft Windows/Computing πŸ”— Computing/Software πŸ”— Microsoft πŸ”— JavaScript πŸ”— Microsoft/.NET

JScript is Microsoft's dialect of the ECMAScript standard that is used in Microsoft's Internet Explorer.

JScript is implemented as an Active Scripting engine. This means that it can be "plugged in" to OLE Automation applications that support Active Scripting, such as Internet Explorer, Active Server Pages, and Windows Script Host. It also means such applications can use multiple Active Scripting languages, e.g., JScript, VBScript or PerlScript.

JScript was first supported in the Internet Explorer 3.0 browser released in August 1996. Its most recent version is JScript 9.0, included in Internet Explorer 9.

JScript 10.0 is a separate dialect, also known as JScript .NET, which adds several new features from the abandoned fourth edition of the ECMAScript standard. It must be compiled for .NET Framework version 2 or version 4, but static type annotations are optional.

Discussed on

πŸ”— List of Java virtual machines

πŸ”— Computing πŸ”— Lists πŸ”— Java

This article provides non-exhaustive lists of Java SE Java virtual machines (JVMs). It does not include a large number of Java ME vendors. Note that Java EE runs on the standard Java SE JVM but that some vendors specialize in providing a modified JVM optimized for Java EE applications. A large amount of Java development work takes place on Windows, Solaris, Linux and FreeBSD, primarily with the Oracle JVMs. Note the further complication of different 32-bit/64-bit varieties.

The primary reference Java VM implementation is HotSpot, produced by Oracle Corporation.

Discussed on

πŸ”— Internet 0

πŸ”— Computing πŸ”— Computing/Networking

Internet 0 is a low-speed physical layer designed to route 'IP over anything.' It was developed at MIT's Center for Bits and Atoms by Neil Gershenfeld, Raffi Krikorian, and Danny Cohen. When it was invented, a number of other proposals were being labelled as "internet 2." The name was chosen to emphasize that this was designed to be a slow, but very inexpensive internetworking system, and forestall "high-performance" comparison questions such as "how fast is it?"

Effectively, it would enable a platform for pervasive computing -- everything in a building could be on the same network to share data gathering and actuation. A light switch could turn on a light bulb by sending a packet to it, they can be linked together by the user.

Discussed on

πŸ”— Scenery nerds and systems nerds: MIT's Model Railroad Club

πŸ”— Computing πŸ”— Trains πŸ”— Trains/Rail transport modelling

The Tech Model Railroad Club (TMRC) is a student organization at the Massachusetts Institute of Technology (MIT). Historically it has been a wellspring of hacker culture and the oldest such hacking group in North America. Formed in 1946, its HO scale layout specializes in automated operation of model trains.

Discussed on