Some aditional resources containing some of my first ideas on computability and the mind, and on universality in real computation

A powerpoint presentation I used for supporting my talk at the Complexity, Society and Science 2005 Conference, University of Liverpool, U.K. is available here:    It is related to my paper “On the possible Computational Power of the Human Mind” recently published as a book chapter in a World Scientific book (see 2 posts below). And […]

On the possible Computational Power of the Human Mind

My paper On the possible Computational power of the Human Mind (co-authored with my BS thesis advisor Francisco Hernández-Quiroz of the Math Department of the National University of Mexico [UNAM], which I delivered as a lecture 2 years ago at the Complexity, Science & Society 2005 Conference at the University of Liverpool, U.K.) has been recently published […]

Collections of axioms and information on theories dependency

List of Axioms from Computer Science Department, University of Miami Documentation, Computer Science Department, University of Miami List of axioms collected from Wikipedia. MBase: A Mathematical Knowledge Base. A collection of definitions, theorems and proofs. The Mathematical Atlas. Methamath. Proof symbolic visualizations, University of Texas.

“The ways of paradox”: Quine on Berry’s paradox.

“Ten has a one-syllable name. Seventy-seven has a five-syllable name. The seventh power of seven hundred seventy-seven has a name that, if we were to work it out, might run to 100 syllables or so; but this number can also be specified more briefly in other terms. I have just specified it in 15 syllables. […]

On single and shortest axioms for Boolean logic

Both the philosopher Charles Sanders Peirce in 1880 and the American logician H. M. Sheffer in 1913 realized that the truth-functions of elementary logic could all be defined from a single operation. The Sheffer stroke, also known as the Nand operation, is a logical operator with the following meaning: p Nand q is true if […]