asr comments on Where Fermi Fails: What is hard to estimate? - Less Wrong

6 Post author: tgb 05 June 2012 03:15AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (46)

You are viewing a single comment's thread.

Comment author: asr 05 June 2012 04:06:51AM 7 points [-]

GCD is easy. Factoring is comparatively hard, though there are algorithms much better than brute force.

I would have said that complexity theory is the place where we often have simple descriptions of hard- or impossible- to compute values. The busy-beaver function, say.

Comment author: tgb 06 June 2012 01:43:52AM 1 point [-]

Busy beaver is a little wordy to state in 10 seconds, but is nonetheless a good example.

(And my example in OP has been revised in light of this oversight.)