You just described a weaker version of Optimal Ordered Problem solving, bro.
Sent from ProtonMail mobile -------- Original Message -------- On Feb 4, 2019, 7:26 AM, Telmo Menezes wrote: > Hi Alan, > > Ok, here's my algorithm: > > 1) Run a universal dovetailer[1] that performs all possible computations; > 2) Stop when you detect a program that beats the readily available baseline. > > Given sufficiently powerful hardware, and that a solution is possible, this > always works. > > Cheers, > Telmo. > > [1] https://en.wikipedia.org/wiki/Dovetailing_(computer_science) > > On Mon, Feb 4, 2019, at 07:42, Alan Grimes wrote: >> I'm going to declare ALL theoretical hardware discussion offtopic UNLESS >> you can provide a piece of code and specifiy what speedup you require in >> order for it to produce practical results over some readily available >> baseline. >> >> -- >> Please report bounces from this address to [email protected] >> >> Powers are not rights. >> ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Td8baca9fcbb1ffff-Mc02c3fce16985ffcb4bd400f Delivery options: https://agi.topicbox.com/groups/agi/subscription
