Questions tagged [terminology]

Questions about how specific notions have to be understood as well as conventions of notation.

Filter by
Sorted by
Tagged with
0
votes
0answers
17 views

Term for language that abstracts program location?

What is the technical term that describes a programming language that abstracts (or at least largely abstracts) the machine location of programs? I’m thinking here specifically of the evolution of ...
1
vote
0answers
25 views

Origin of GUI terminology

I'm wondering where the GUI terminology like modal dialogue comes from. Who first used these terms? Is there a paper or a book, or was it just sw?
4
votes
2answers
156 views

Why is the second operation of a Monad called bind?

I understand how monadic computation works, I am just wondering where does the name come from. I cannot relate the thing that the bind operator actually does (i.e. ...
1
vote
1answer
92 views

Why F-bounded polymorphism and F-bounded quantification are called, well, F-bounded

It's claimed in Wikipedia that: F-bounded quantification or recursively bounded quantification, introduced in 1989, allows for more precise typing of functions that are applied on recursive ...
3
votes
0answers
996 views

Backtracking vs Branch-and-Bound

I'm getting a bit confused about the three terms and their differences: Depth-First-Search (DFS), Backtracking, and Branch-and-Bound. What confuses me: Stack Overflow: Difference between '...
2
votes
2answers
62 views

Does the word "efficient" usually refer to polynomial time or polylogarithmic time?

This question is strictly about terminology. I'm not an expert in CS, but I've almost always seen the word "efficient" applied to an algorithm to mean "of polynomial runtime". E.g. this question and ...
1
vote
1answer
66 views

to bail out vs to back out

In a CS context, I have often come across the expression to back out meaning to say that a function is returned from before performing its actual task, as in this imaginary code comment: ...
1
vote
1answer
48 views

The characterization of a problem as PSPACE-complete is ...?

Let's assume that you found out that some problem $\mathit{\Pi}$ is PSPACE-complete (with respect to your favorite kind of reductions, say, logspace reductions). However, as there are dozens of well-...
0
votes
2answers
91 views

IS there a consensus on the definition of a computer program in CS literature and if so, what is it?

The following is what I came up with from my synthetic prior research but I might be wrong. I understand it is possible to reduce any computer "program", in a maximal reduction(?), to these features: ...
2
votes
1answer
208 views

Name for sorting algorithm "while not sorted, swap the FIRST unordered pair"

A typical bubble sort steps through all pair indices until it reaches the end of the list, then starts a new pass. For a toy problem, we have a variant that just performs the first available swap in ...
27
votes
2answers
9k views

Is there a name for the class of algorithms that are the most efficient for a particular task?

This would be analogous to the Kolmogorov complexity of a string, except that in this case, I'm interested in the algorithm that solves a given problem using the least number of steps. We would ...
1
vote
0answers
74 views

What are precisely computational effects?

I'm really confused with definition of computational effects. What I knew and understood about computational effect were only that they're impure computation, but someone noticed me that computational ...
1
vote
1answer
60 views

trace vs. computation vs. run vs. execution vs. walk

Many folks use the terms "trace", "execution", "computation", "run", "walk" ... interchangeably when they speak about state machines with labeled transitions. Does any work distinguish between these ...
1
vote
2answers
115 views

Is Turing machine a scientific theory in CS?

The English Wikipedia article about Turing machine opens with: A Turing machine is a mathematical model of computation that defines an abstract machine,[1] As a Hebrew speaker, I read a similar ...
0
votes
1answer
65 views

Is there a name for a graph whose vertices consist of edges of an existing graph connected by an edge if they shared a common vertex?

I was wondering if there is a name for this construction: Take a graph $G$ and construct a new graph $G'$ in which the edges of $G$ now become vertices, and "vertices become edges" in the sense that ...
1
vote
0answers
36 views

Meaning of "uniformly computably enumerable in m"

Nies, in Computability and Randomness, p. 6, defines "uniformly computably enumerable": A sequence of sets $(S_e)_{e\in\mathbb{N}}$ such that $\{\langle e,x \rangle : x \in S_e \}$ is c.e. is ...
1
vote
0answers
28 views

What is the maths name for a set which contains the Domain and Codomain of a function? [closed]

Im interested in this so that I can name a type parameter in a program I'm writing. There is function that that has three parameters. D, Domain C, Codomain X, where D is a subset of X and C is a ...
0
votes
2answers
180 views

Does the callback concept of programming have any basis in computer science?

Although I seriously code with computer languages in general since 2010 and as an amateur programmer with programming languages in particular since 2015 (primarily Bash and JavaScript imperative ...
0
votes
1answer
61 views

What is the result of a reduction operation called?

Is there a commonly used term for the result of a reduction operation? "reductant" does not quite sound right...
0
votes
1answer
71 views

Exact meaning of metalinguistic variable

Consider the following BNF <join-command> ::= <string> + <string> In this context <join-command> and <...
2
votes
1answer
2k views

What's the difference between phi and lambda in regular expression?

I've been learning on Formal Languages and Automata of Peter Linz(6th edition). In the chapter 3 of this book, it explains the primitive regular expression. But I don't know what is the difference ...
3
votes
1answer
169 views

maximum coverage version of dominating set

The dominating set problem is : Given an $n$ vertex graph $G=(V,E)$, find a set $S(\subseteq V)$ such that $|N[S]|$ is exactly $n$, where $$N[S] := \{x~ | \text{ either $x$ or a neighbor of $x$ ...
3
votes
1answer
1k views

How can Lagrange Multipliers and Penalty Method be applied to optimize algorithms?

I have a programming assignment which I was told that is solvable with some DP algorithm. The question is a variant of LIS problem where at most $k$ exceptions (restarts) are allowed. But I know that ...
0
votes
0answers
153 views

Was there an attempt to create a programming language aimed for maximal abstraction?

I am trying to understand if a programming language can have totally or almost totally the abstraction level shared between generally all human languages so that it would allow a human to code a ...
1
vote
1answer
684 views

Difference between task and process

I'd like to know which is the difference between a task and a process in computer science. I'm studying a course on real-time systems and there are some definitions that I don't know. Thank you in ...
1
vote
1answer
37 views

WebHook versus API

I've read many blogs about this but I still get somehow confused, specially why a webhook is a thing vs an API and not just a subset of API. The way I interpret from most places (and interpret is ...
1
vote
1answer
17 views

What category does questions like "Given n points on 2D plane find ..." belong to

Not after a specific answer, do following questions belong to same set of problem types? Given n points in on 2D plane, find 4 or 5 , or m subset of points with less total distant to each other than ...
1
vote
2answers
145 views

Run-Time environments

I was reading about Run-Time Environments. In the Dragon book (2nd ed.) I came across the following presentation: [To implement abstractions, the] compiler ...
0
votes
0answers
116 views

Little Endian vs Big Endian?

Suppose a processor uses the big endian representation and x is a 32-bit integer stored in memory starting at the memory address 1000. The memory is byte-addressable, each location holding a byte. ...
1
vote
1answer
513 views

What is memory model in computer organization?

I'm new to Computer Organization and even to this community. I didn't find anything which was simple, clear and up to the point. Any examples supporting the discussion is appreciated. I'm not looking ...
-3
votes
2answers
235 views

Is automata concept theorized in computer science and what would be a simple example?

I understand the terms automata or automaton to mean "self operating machine". I can't think of any such "machine" besides maybe (if it is even a machine and even exits) cyclic universe of a big-bang-...
1
vote
1answer
57 views

Is it common in the literature to define regular languages and serialization languages as programming languages?

Often when I create programs I use operating-programming language such as Bash for automating OS operations, structure ("markup") language such as HTML to define structures, styling language such as ...
3
votes
3answers
188 views

Are regular languages and their regular expressions part of computer science?

I am trying to understand if regular languages and their regular expressions are concepts of computer science in general and if these are discovered, or invented, by computer scientists, in particular....
0
votes
1answer
25 views

Are event and mode well defined terms in CS literature?

From my experience in programming small imperative scrips for personal usage with JavaScript, I can conclude that an event is "A perceived change in the output of a system" (such as clicking a link ...
6
votes
7answers
1k views

Essential difference between Assembly languages to all other programming languages

I understand that any assembly programming language has so little abstraction, so that one who programms with it (OS creator, hardware driver creator, "hacker" and so on), would have to know the ...
2
votes
2answers
137 views

Is program coding part of computer science?

As an amateur Bash/JavaScript scripter I was wondering if program coding ("writing source code") in general, and abstractless coding in particular (binary) is a concept of Computer Science or just an ...
0
votes
0answers
42 views

Is 'the bombe' technically a computer?what is technically meant to be a computer?

Some say that 'the bombe' created by Alan Turing is technically not a computer despite decrypting the codes. Why is it so? Is 'the bombe' technically a computer? First of all what is technically ...
1
vote
0answers
14 views

Is an error-correcting code where the parity symbols are interleaved with the data symbols considered systematic?

According to the Wikipedia entry, a systematic code is one in which the input data is embedded in the encoded output. Conversely, in a non-systematic code the output does not contain the input ...
4
votes
1answer
74 views

Difference between ⫾ (U+2AFE) and ⫿ (U+2AFF) in the context of Dijkstra's Guarded Command Language?

Continuing https://tex.stackexchange.com/questions/435986/how-to-draw-the-box-of-dijkstras-guarded-command-language, what is the difference in the intended usage of ⫾ (Dijkstra choice, U+2AFE) and ⫿ (...
1
vote
1answer
33 views

Distributed algorithm can be executed in a single process

Looking at a "Distributed" algorithm from a textbook on distributed algorithms (e.g. Building a spanning tree, Broadcast/Convergecast.) I found that one can implement it using Golang's concurrency ...
1
vote
2answers
35 views

Is there a concept called "white waveforms" in computer science?

It sounds like the lecturer is speaking If you for example want to play a music file, mp3 file, well you know, given that you've taken a programming course before, all right? How would you do ...
2
votes
2answers
138 views

Typesetting LTL in Unicode?

Unicode has an abundance of open circles, diamonds and boxes. Using these, we can typeset linear-time temporal logic formulas such as $$ (\mathop{⬦}ψ)\ \,\land\ \,\mathop{⬦}(θ\ \mathsf{U}\ \mathop{◻}\...
1
vote
2answers
62 views

What does "prime" mean in this context?

In a lecture video the instructor introduced the quadratic probing method for hash tables. The formula he gave was the following: $h(k,i) = (h'(k) + c_1 + c_2i^2)$ $\% M$ where $h'$ was h "prime". ...
0
votes
0answers
35 views

General term for upcasting and downcasting?

Is there a more precise term than simply "casting"? "Casting" often includes for example integer -> float or ...
1
vote
1answer
2k views

Least Significant Bit (LSB) vs Little Endian - Are they equivalent in anyway!

For a multiple choice question: What do we call the LSB? (i)Little Endian (ii)Upper bit (iii)Big Endian (iv)Lower Bit I feel ideally none of them is a true correct choice, but my best bet was (...
3
votes
1answer
32 views

Hardness of approximation statement clarification?

In the paper I'm reading, there is a hardness of approximation result for an algorithm proved using a reduction to set cover. Roughly, the claim states that if there existed an algorithm that solved ...
1
vote
2answers
36 views

Algorithm for producing array of objects according to the given distribution

I have a set of objects, and each object has (let's say) a color. Given a distribution such as: ...
4
votes
2answers
1k views

Does the Hack computer from "The Elements of Computing Systems" use Von Neumann architecture?

I'm reading "The Elements of Computing Systems" (subtitled "Building a Modern Computer from First Principles - Nand to Tetris Companion) by Noam Nisan and Shimon Schocken. Chapter 4 is about machine ...
3
votes
2answers
93 views

What is the name of the operator that translates from $X\rightarrow(Y\rightarrow Z)$ to $Y\rightarrow(X\rightarrow Z)$?

Is there a standard name for the operator that takes a function $f:X\rightarrow(Y\rightarrow Z)$ and returns the function $f':Y\rightarrow(X\rightarrow Z)$ that satisfies, for every $y \in Y$ and $x \...
1
vote
1answer
86 views

Terminology: Difference between decision variables, features and attributes?

Could there be a difference between the words "feature", "attribute", and "decision variable" when used in the same paper? The one I am specifically thinking about is about an optimization method for ...

1
2
3 4 5
22