309 reputation
18
bio website twitter.com/trylks
location
age 31
visits member for 2 years, 11 months
seen Aug 29 at 4:49

I am

  • sorry.
  • a brain in a bucket (a nice one but its planned obsolescence kind of sucks)
  • trying really hard to do my best.
  • connected to the Internet.
  • thankful.
  • not Japanese (and I don't speak Japanese) but I have to say this:
    優しさにはいつも感謝してる
    だから強くなりたい 進む為に
  • a pseudonym, I don't want to link my real name with my procrastination and stupid questions. Previous points ease the solution verification for anyone who may have know it. There are not many brains in buckets out there, or so I've been told.

May
15
awarded  Popular Question
Oct
28
answered Is a traditional Multi Layer Perceptron Network capable of non-linear regression? Which activation function should be used for that purpose?
Oct
28
comment Is a traditional Multi Layer Perceptron Network capable of non-linear regression? Which activation function should be used for that purpose?
I think this question is very simple and will probably be closed, but I'll reply anyway in case it is useful.
Oct
28
comment How to measure programming language succinctness?
I'm not sure the bytes is what you want to consider. What about considering terminal symbols and their entropy, and then grammatical (syntactical) constructions and their entropy nesting them up to the size of the program? A succinct language should have high entropy in the symbols, sparing the programmer from repetitions, low entropy in the grammar would mean it's a simple to learn language. Fewer grammar constructions in the sum of a program means more powerful ones, good fun. In short, I think you should compare trees, not characters and not exactly algorithms (Kolmogorov). LMKWYT.
Oct
8
answered What kind of graphs we need to know for experimental results?
Oct
8
comment Definition of a free variable in Tuple Relational Calculus (TRC)
I don't even know what is TRC, but since it's relational a free variable may refer to a variable that is not bound by any relation (as you mention). A relation may thus restrict the possibilities of unification of that variable by defining a range of valid values. A free variable would be free to unify. In Horn clauses the term "free variable" is used for existential variables, if I'm not mistaken (they are not in a join nor in the head), so the term "free" may be more general and used widely than simply referring to quantifiers.
Oct
3
comment Difference between self-information and entropy
@PeterShor yes, definitively, I was going to point that out with Markov chains, due to the conditional probability of a word given the previous one(s), but then I forgot.
Oct
3
answered Difference between self-information and entropy
Aug
13
comment Is propositional resolution a complete proof system?
That's why some people say it is "refutationally complete", e.g. L. Bachmair and H. Ganzinger, “Resolution theorem proving,” Handbook of automated reasoning, vol. 1, pp. 19–99, 2001.
Aug
12
revised What is resolution ((in FOL))?
deleted 554 characters in body
Aug
12
accepted What is resolution ((in FOL))?
Aug
12
revised Minimize a datalog program
added 195 characters in body
Aug
9
comment Satisfaction and synthesis of models in logics
Any logic with the existential quantifier (or functions, or the universal quantifier and negation) can have models that are infinite. Actually, e.g. $\forall x. person(x) \rightarrow parent(x,y), person(y). \\ person('Adam').$.
Aug
9
revised What is resolution ((in FOL))?
added 4 characters in body
Aug
9
revised What is resolution ((in FOL))?
added 552 characters in body
Aug
9
comment What is resolution ((in FOL))?
@YuvalFilmus I think you didn't understand the question, please let me know any detail that may not be clear. Thank you.
Aug
8
comment Can a computer simulate itself as part of a simulated world?
What is a "CA"? Also I'm not certain about the totalistic nature of the universe, but quantum entanglement is an interesting property in this sense. E.g. Consider the computer is everything: it predicts the future as fast as time passes. Can it be less than everything so that we have a part of the universe out of the computer? Yes, it can be everything minus entangled particles. So there it is, the computer is already working and doing a good job.
Aug
8
comment Can a computer simulate itself as part of a simulated world?
How do you infer that the universe has more states than the computer?
Aug
8
revised What is resolution ((in FOL))?
testing, sorry I should not play with this
Aug
8
comment What language does Zeno machines recognize?
AFAIK, anything that a Turing machine would recognize in infinite time.