# Tag Info

Accepted

### Is it a Known Concept to Compute an Algorithm Once and Re-Interpret Answer for Different Inputs

I'm not sure, but you might be talking about what has been termed incremental computation. The key idea behind incremental computation is to program in a way such that the program responds to input ...
Accepted

### Adjective for: algorithm that outputs its input if it is one of its outputs?

In mathematics we would say $f$ is an idempotent function. It's a widely known term and I suppose most TCS people should also recognize it.

### Is it a Known Concept to Compute an Algorithm Once and Re-Interpret Answer for Different Inputs

Some of the very early work on complexity theory used a sequential time model -- that is, rather than studying the worst-case runtime of the TM that can produce the correct output on an arbitrary ...

### Are there any intersections between Theory A and Theory B?

One cool example of work that straddles things that are typically considered theory A and things typically considered theory B are the lower bounds on the running time of the simplex algorithm with ...
Accepted

### Terminology about computation and Finite algebra

Such algebras are called functionally complete. Also, what you call terms are actually called polynomials. In standard terminology, term operations have a more restricted definition that allows ...

1 vote

### Constraint terminology

To be clear that I understand the context, I'm going to first reproduce you situation worded differently. Consider a sequence of sets, $C_i$, and a target function, $f$. Let $\cup C_i=C$. We wish ...
1 vote

### what does "lifting" mean?

There is also Hensel lifting in modular arithmetic, that allows you to relate roots of a polynomial over a ring of integers modulo prime $p$ to roots of the same polynomial over integers modulo higher ...
1 vote

### What is First-Order Rewritable (and FO-Query)?

As a complement to Janoma's answer above: it's 'very good'--- from the point of view of implementation --- because given a FO-rewritable language, we can use the powerful engines (for evaluating ...

Only top scored, non community-wiki answers of a minimum length are eligible