How can we (loosely) check whether variable
A is determined, not directly computing
(= How can we define
DeterminedQ function ?)
In x=a+b In a=2
Then x is not completely determined yet. So,
In DeterminedQ[x] Out False
But if we go further
Out DeterminedQ[x] Out True
I have an idea. My idea is inspecting
Definition[x], and get variable names
v1,v2,... those constructing
x. Then inspect
Definition[v1], Definition[v2], ..., repeat, repeat.
If we encounter a variable w such that defition[w] produces Null, then
x is not determined,
DeterminedQ[x] must be false.
Otherwise, variables at bottom level will turn out to be mixture of determined numbers or strings, etc. In this case
DeterminedQ[x] must be true.
But there is a problem in my idea. For example,
x is mathematically determined becuase
x == a*0 == 0, but according to my idea,
DeterminedQ[x] becomes false, because
And if we make a mathematica code,
x = the least even number that is not sum of two prime numbers
(The code can be written using
Then the existence of
x is not known mathematically, but according to my idea,
DeterminedQ[x] becomes true.
I don't care whether
x is determined mathematically or not.
I just want
DeterminedQ function, which is loose but super fast, always give true or false.
...Or, there may be a built-in function already. Can you construct/know
DeterminedQ-like function ?
NumericQdo what you want? $\endgroup$
Ait would give a numeric value if it were evaluated? If so, note that
Aand sees if the result is numeric. That seems not to be what is required by "determined, not directly computing A." $\endgroup$