This post is inspired by the question Are runtime bounds in P decidable? asked by John Sidles on the CSTheory website, and the answer given by Emanuele Viola. Is there an automatic procedure to determine whether a given Turing machine, known to be halting, operates within time bound O(f) (assuming f is a computable function)? [...]
Antonio E. Porreca
Wannabe computer scientist
Recent posts
Archives
- February 2012 (1)
- January 2012 (1)
- August 2011 (1)
- February 2011 (1)
- January 2011 (1)
- December 2010 (3)
- August 2010 (3)
- July 2010 (8)
- There’s a reason why they don’t make a lot of movies about mathematicians. abstrusegoose.com/466 21 hours ago
- RT @TeXtip: Generate LaTeX tables from CSV files ow.ly/beTIJ 1 day ago
- RT @CodeWisdom: "The purpose of abstraction is not to be vague, but to create a new semantic level in which one can be absolutely precis ... 5 days ago
- Dymaxion map. (Dymaxion map - Wikipedia, the free encyclopedia) en.wikipedia.org/wiki/Dymaxion_… 6 days ago
- RT @FakeElsevier: What happens behind the paywall, STAYS behind the paywall… #MakingClosedAccessSoundLurid 1 week ago
- The call of Cthulhu. j.mp/JqD03z 1 week ago
- Free online tool to create a vector font from your own handwriting (it works.) myscriptfont.com 2 weeks ago
- RT @Oatmeal: Why Nikola Tesla was the greatest geek who ever lived is.gd/p4dLSj 2 weeks ago
- Fibonacci pigeons. ( mathblag.files.wordpress.com/2011/11/fibona…) mathblag.files.wordpress.com/2011/11/fibona… 3 weeks ago
- Paintings by Remedios Varo Uranga (December 16, 1908–October 8, 1963), Spanish-Mexican para-surrealist painter and… plus.google.com/11525690607891… 3 weeks ago
Links
Blog at WordPress.com. Theme: Sapphire by Michael Martine.
