Reputation
526
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
5 12
Newest
 Necromancer
Impact
~35k people reached

  • 0 posts edited
  • 1 helpful flag
  • 335 votes cast
Apr
22
comment Why do we call primes, and not the number one, *the atoms of numbers*?
historically spking wonder who first associated primes and atoms?
Feb
4
awarded  Necromancer
Oct
16
comment What is the number of distinct 3 letter words out of different number of given letters?
??? think this problem is not clearly stated. it seems to be saying, "of a large number of [x], filtered by criteria [y], how many are possible" but [x] seems unclear.
Oct
16
comment What is the number of distinct 3 letter words out of different number of given letters?
$0 \leq a,b,c \leq 3$ right?
Oct
16
comment What is the number of distinct 3 letter words out of different number of given letters?
what do you mean "the computer does not accept it"?
Oct
16
comment What is the number of distinct 3 letter words out of different number of given letters?
how do you know your formula is wrong? if you have code to test it, the pseudocode for this test would be helpful to post also.
Sep
19
accepted formal definition of “fractal” or standardized categories?
Sep
18
comment formal definition of “fractal” or standardized categories?
@Eric think you have a start at one definition or broad category, but wonder about necessary vs sufficient conditions. are all invarant sets of iterated function systems fractals? and are all fractals invarant sets of iterated function systems? one would at least have to show that all classic fractals can be converted. 2 test cases: sierpinski triangle, mandelbrot set. etc. ps Wolfram has a lot of writing/ analysis & relating to classifications etc.
Sep
17
asked formal definition of “fractal” or standardized categories?
Sep
12
comment Is the reduction correct?
try reading about Turing completeness. have never heard of any proof of reduction to undecidability that does not at least implicitly involve it.
Sep
4
awarded  Civic Duty
Sep
4
answered Examples of open problems solved through short proof
Sep
4
comment Examples of open problems solved through short proof
see also RJLipton open problems that might be easy
Aug
29
comment Can a method related to “Weisfeiler-Lehman Method” provide better time complexity for Graph Isomorphism than existing result?
the paper and question do not cite Weisfeiler-Lehman except by name. what is the ref?
Aug
22
comment Can a method related to “Weisfeiler-Lehman Method” provide better time complexity for Graph Isomorphism than existing result?
the link now comes up 404
Aug
13
comment Is The Clique Algorithm by Ashay Dharwadker correct?
have you actually verified this example with their code? program output would be helpful
Aug
13
comment Is The Clique Algorithm by Ashay Dharwadker correct?
GI is conjectured to be in NPI so GI in P would not affect P vs NP in that scenario. more on this: is anyone aware of a counterexample to the Dharwadker GI algorithm/ Theoretical Computer Science
Jul
27
comment The existential theory is undecidable
it would be helpful if you cite ref, pg
Jul
19
comment Existential theory
are you asking about (iv)? the basic idea of this is that it is setting up conditions that the existential theory of a quotient field of R is decidable...
Jul
18
comment Existential theory
have you looked at the introduction of [125] as directed? what is [125]? plz cite [125] and this reference you have photocopied here.