Conceptually, I think one could follow Goedel's recursive procedure where he mapped the descriiption of arithmetic (by logical statements) into actual arithmetic statements such that if one logical statement followed from another then you could execute the arithmetic statement for the first and get the second among the results. This is possible and as I said he proved that it leads to an uncompleteness theorem in the case of arithmetic. But I think it would stay consistent if you so described a finite state machine. And if the human mind is such a machine - a big if, but not completely unreasonable to suppose - then you could get the description you ask about.PIT2 said:So even if the finite number of cells, etc. is true then there is no problem with the formula describing something which contains the origin of itself?
No, I think it was very relevant to the point I was making. Thank you.arildno said:This was probably off-topic..