noncomputable

As an adjective noncomputable is

(mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time.

As a noun taxonomy

is the science or the technique used to make a classification.

As an adjective noncomputable is

(mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time.

Noncomputable is a hypernym of zeno.

As adjectives the difference between noncomputable and zeno

is that noncomputable is (mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time while zeno is requiring or involving an infinite number of intervals within a finite time.

As a proper noun zeno is

.

As an adjective noncomputable

is (mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time.

As a noun noncomputability is

the state or condition of being noncomputable.

As adjectives the difference between noncomputable and mobile

is that noncomputable is (mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time while mobile is capable of being moved.

As a noun mobile is

a sculpture or decorative arrangement made of items hanging so that they can move independently from each other ().

Noncomputable is a related term of undecidable.

As adjectives the difference between noncomputable and undecidable

is that noncomputable is (mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time while undecidable is (mathematics|computing theory) incapable of being algorithmically decided in finite time for example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included.

Nonrecursive is a synonym of noncomputable.

As adjectives the difference between nonrecursive and noncomputable

is that nonrecursive is (computing) not recursive while noncomputable is (mathematics|of a function) incapable of being computed by any deterministic algorithm in any finite amount of time.