Topic: Computing/Software (Page 3)

You are looking at all articles with the topic "Computing/Software". We found 150 matches.

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

πŸ”— I never realized how useful netcat is

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

netcat (often abbreviated to nc) is a computer networking utility for reading from and writing to network connections using TCP or UDP. The command is designed to be a dependable back-end that can be used directly or easily driven by other programs and scripts. At the same time, it is a feature-rich network debugging and investigation tool, since it can produce almost any kind of connection its user could need and has a number of built-in capabilities.

Its list of features includes port scanning, transferring files, and port listening, and it can be used as a backdoor.

Discussed on

πŸ”— Do What the Fuck You Want to Public License

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

WTFPL is a GPL-compatible permissive license most commonly used as a free software license. As a public domain like license, the WTFPL is essentially the same as dedication to the public domain. It allows redistribution and modification of the work under any terms. The title is an abbreviation of "Do what the fuck you want to Public License".

The first version of the WTFPL, released in March 2000, was written by Banlu Kemiyatorn for his own software project. Sam Hocevar, Debian's former project leader, wrote version 2.

Discussed on

πŸ”— Project Xanadu

πŸ”— Internet πŸ”— Computing πŸ”— Telecommunications πŸ”— Computing/Software πŸ”— Computing/Networking

Project Xanadu ( ZAN-Ι™-doo) was the first hypertext project, founded in 1960 by Ted Nelson. Administrators of Project Xanadu have declared it an improvement over the World Wide Web, with the mission statement: "Today's popular software simulates paper. The World Wide Web (another imitation of paper) trivialises our original hypertext model with one-way ever-breaking links and no management of version or contents."

Wired magazine published an article called "The Curse of Xanadu", calling Project Xanadu "the longest-running vaporware story in the history of the computer industry". The first attempt at implementation began in 1960, but it was not until 1998 that an incomplete implementation was released. A version described as "a working deliverable", OpenXanadu, was made available in 2014.

Discussed on

πŸ”— Fred Fish (Fish Disks)

πŸ”— Biography πŸ”— Computing πŸ”— Biography/science and academia πŸ”— Computing/Software πŸ”— Computing/Free and open-source software πŸ”— Computing/Amiga πŸ”— Open

Fred Fish (November 4, 1952 – April 20, 2007) was a computer programmer notable for work on the GNU Debugger and his series of freeware disks for the Amiga.

The Amiga Library Disks – colloquially referred to as Fish Disks (a term coined by Perry Kivolowitz at a Jersey Amiga User Group meeting) – became the first national rallying point, a sort of early postal system. Fish would distribute his disks around the world in time for regional and local user group meetings, which in turn duplicated them for local distribution. Typically, only the cost of materials changed hands. The Fish Disk series ran from 1986 to 1994. In it, one can chart the growing sophistication of Amiga software and see the emergence of many software trends.

The Fish Disks were distributed at computer stores and Amiga enthusiast clubs. Contributors submitted applications and source code and the best of these each month were assembled and released as a diskette. Since the Internet was not yet in popular usage outside military and university circles, this was a primary way for enthusiasts to share work and ideas. He also initiated the "GeekGadgets" project, a GNU standard environment for AmigaOS and BeOS.

Fish worked for Cygnus Solutions in the 1990s before he left for Be Inc. in 1998.

In 1978, he self-published User Survival Guide for TI-58/59 Master Library, which was advertised in enthusiast newsletters covering the TI-59 programmable calculator.

Discussed on

πŸ”— MSX-DOS

πŸ”— Computing πŸ”— Computing/Software πŸ”— Microsoft

MSX-DOS is a discontinued disk operating system developed by Microsoft for the 8-bit home computer standard MSX, and is a cross between MS-DOS v1.25 and CP/M-80Β v2.2.

Discussed on

πŸ”— Namecoin

πŸ”— Computing πŸ”— Computing/Software πŸ”— Numismatics πŸ”— Software πŸ”— Software/Computing πŸ”— Numismatics/Cryptocurrency πŸ”— Cryptocurrency πŸ”— Computing/Computer Security

Namecoin (Symbol: β„• or NMC) is a cryptocurrency originally forked from bitcoin software. It is based on the code of bitcoin and uses the same proof-of-work algorithm. Like bitcoin, it is limited to 21 million coins.

Namecoin can store data within its own blockchain transaction database. The original proposal for Namecoin called for Namecoin to insert data into bitcoin's blockchain directly. Anticipating scaling difficulties with this approach, a shared proof-of-work (POW) system was proposed to secure new cryptocurrencies with different use cases.

Namecoin's flagship use case is the censorship-resistant top level domain .bit, which is functionally similar to .com or .net domains but is independent of ICANN, the main governing body for domain names.

Discussed on

πŸ”— Ralf Brown's Interrupt List – a comprehensive CMOS settings, port addresses

πŸ”— Computing πŸ”— Computing/Software

Ralf Brown's Interrupt List (aka RBIL, x86 Interrupt List, MS-DOS Interrupt List or INTER) is a comprehensive list of interrupts, calls, hooks, interfaces, data structures, CMOS settings, memory and port addresses, as well as processor opcodes and special function registers for x86 machines from the 1981 IBM PC up to 2000, most of it still applying to IBM PC compatibles today.

πŸ”— C Minus Minus

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

C-- (pronounced C minus minus) is a C-like programming language. Its creators, functional programming researchers Simon Peyton Jones and Norman Ramsey, designed it to be generated mainly by compilers for very high-level languages rather than written by human programmers. Unlike many other intermediate languages, its representation is plain ASCII text, not bytecode or another binary format.

There are two main branches:

  • C--, the original branch, with the final version 2.0 released in May 2005
  • Cmm, the fork actively used as the intermediate representation (IR) in the Glasgow Haskell Compiler (GHC)

Discussed on

πŸ”— AGPL License

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

The Affero General Public License (Affero GPL and informally Affero License) is a free software license. The first version of the Affero General Public License (AGPLv1), was published by Affero, Inc. in March 2002, and based on the GNU General Public License, version 2 (GPLv2). The second version (AGPLv2) was published in November 2007, as a transitional license to allow an upgrade path from AGPLv1 to the GNU Affero General Public License (a variant of the original Affero GPL license that is compatible with GPLv3).

Both versions of the Affero GPL were designed to close a perceived application service provider (ASP) loophole in the ordinary GPL, where, by using but not distributing the software, the copyleft provisions are not triggered. Each version differs from the version of the GNU GPL on which it is based in having an added provision addressing use of software over a computer network. This provision requires that the full source code be made available to any network user of the AGPL-licensed work, typically a web application.

Discussed on

πŸ”— Karatsuba Algorithm

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

The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It reduces the multiplication of two n-digit numbers to at most n log 2 ⁑ 3 β‰ˆ n 1.58 {\displaystyle n^{\log _{2}3}\approx n^{1.58}} single-digit multiplications in general (and exactly n log 2 ⁑ 3 {\displaystyle n^{\log _{2}3}} when n is a power of 2). It is therefore faster than the classical algorithm, which requires n 2 {\displaystyle n^{2}} single-digit products. For example, the Karatsuba algorithm requires 310 = 59,049 single-digit multiplications to multiply two 1024-digit numbers (n = 1024 = 210), whereas the classical algorithm requires (210)2 = 1,048,576 (a speedup of 17.75 times).

The Karatsuba algorithm was the first multiplication algorithm asymptotically faster than the quadratic "grade school" algorithm. The Toom–Cook algorithm (1963) is a faster generalization of Karatsuba's method, and the SchΓΆnhage–Strassen algorithm (1971) is even faster, for sufficiently large n.

Discussed on