*Toward teaching computability and complexity simultaneously*

Wilhelm Ackermann was a mathematician best known for work in constructive aspects of logic. The… 1,007 more words

*Toward teaching computability and complexity simultaneously*

Wilhelm Ackermann was a mathematician best known for work in constructive aspects of logic. The… 1,007 more words

I’ve run across some of his work before, but I ran into some new material by Hector Zenil that will likely interest those following information theory, complexity, and computer science here. 482 more words

In the article SKETCH OF A PROOF: COMPUTABLE TOTAL FUNCTIONS ARE NOT ENUMERABLE I have used the notion of “total functions”. What is so special about “total functions”? 752 more words

Alonzo Church (left) and Alan Turing (right)

Alan Turing is no doubt the most well-known of all computer scientists. His Turing machine is justly famous, and the video below shows a really cool… 560 more words

Hi,

here it comes here it goes! Today I am writing probably the last post from Brazil since I am leaving in Tuesday. Maybe tommorow after seeing Christ in Rio, I will be able to write another one. 494 more words