Discussion about this post

User's avatar
Purnima Gauthron's avatar

Isn't ChatGPT "Intelligent" enough to fix itself? I mean if I'm drunk and shouting at the toilet I can still fix myself.

Expand full comment
Roumen Popov's avatar

"The need for altogether different technologies that are less opaque, more interpretable, more maintanable, and more debuggable — and hence more tractable—remains paramount." - exactly! We need a formal theory of intelligence that explains such things as reasoning, understanding and knowing, with algorithms that are mathematically provable to be sane and reliable. This has been the real holy grail of AI as a field since its inception, but because it's a very hard problem, somewhere along the way people decided to take the easy route of behaviourism which focuses on achieving practical results at the expense of understanding the theory. Neural networks are the pinnacle of that philosophy, being described as black boxes that "just work". We need to go back to square one and re-evaluate what new route to take. I am putting my money on Bayesian methods and variational inference as building blocks because at least theoretically they satisfy the requirement for mathematically provable saneness and reliability.

There is a counter argument, that a mathematical theory of intelligence might be impossible because there are a lot of non-computable problems. This is true, there are a lot of non-computable problems, furthermore there are problems that while computable in principle are prohibitively expensive in practice. In fact, I would argue that most problems from the real world are unsolvable exactly. I don't view this as an unsurmountable problem though, because we can usually use approximate solutions that are provably good enough. For example, with the exception of integer arithmetic, all floating point math on a computer is actually approximate because we use discrete representations of the continuous set of real numbers. Another beautiful example of approximate solution to an otherwise hard or non-computable problem is Newton's method for finding roots, or Taylor/Fourier series expansion to approximate functions. Engineering is in fact full of approximations, nearly any powerful method for solving a hard problem in engineering is actually an approximation. So, my point is, we don't need to solve problems exactly, we can solve them approximately if the approximation is provably good enough, and approximations are computable and of relatively low complexity.

Expand full comment
82 more comments...

No posts