« earlier | later » Page 1 of 1

Shtetl-Optimized » Blog Archive » The Power of the Digi-Comp II: My First Conscious Paperlet edit / delete

"I study the Digi-Comp II, a wooden mechanical computer whose only moving parts are balls, switches, and toggles. I show that the problem of simulating (a natural abstraction of) the Digi-Comp, with a polynomial number of balls, is complete for CC (Comparator Circuit)". A nice short example, with some interesting discussion on what the Digi-Comp can and can't compute and why.

to complexity computability cs digicomp mechanica retrocomputing theory ... on 11 July 2014

P-versus-NP page edit / delete

A list of work proving or disproving P=NP.

to amusements cs research theory ... on 16 November 2008

You Can't Get There From Here edit / delete

A neat little guide to the concept of NP-completeness.

Epsilon-Delta: Mathematics and Computer Programming » Modeling a Resource Pool edit / delete

to concurrency cs maths research server theory ... on 20 May 2006

An Oxford course for beginners to the lambda calculus.

to functional lambda-calculus research theory ... on 20 March 2006

Logical Methods in Computer Science edit / delete

An open-access TCS journal.

to cs journal open-access research theory ... on 27 October 2005

« earlier | later » Page 1 of 1

- theory | |

1 | + amusements |

1 | + complexity |

1 | + computability |

1 | + concurrency |

5 | + cs |

1 | + digicomp |

1 | + functional |

1 | + journal |

1 | + lambda-calculus |

1 | + maths |

1 | + mechanica |

1 | + open-access |

5 | + research |

1 | + retrocomputing |

1 | + server |

1 | + teaching |

tasty by Adam Sampson.