I *think* the most compact net to solve the XOR problem is one where the two input nodes are connected to the one output node and to a single hidden node, which is also connected to the output node.
Does anybody know of research regarding normal mathematical operators, such as divide or squaring, which shows e.g. how many hidden nodes are required?
Log in to post a comment.
Sign up for the SourceForge newsletter:
You seem to have CSS turned off.
Please don't fill out this field.