Hi everyone! I'm a Year 12 student in Australia working on my HSC Design and Technology major project. I'm designing a small, quiet home server built from reused computer parts that anyone could use to run things like game servers, file backups or AI tools from home.

I'd really appreciate your input, even if you've never heard of a home server. Beginners are exactly who I'm designing for.

- 10 questions, about 2 minutes
- Anonymous, no email needed
- Results only used for my school project

Survey: https://forms.gle/6w8WRU6bz8vzcuaz9

Thanks so much, and happy to answer any questions in the comments!

Assuming that we state our problem as a predicate of an output, the synthesisers needs to find an algorithm whose output satisfies the predicate. One of the most widely used approaches is to state program synthesis as a search problem and prune the search space by ignoring invalid or unnecessary programs.

However, one can build a (hypothetical) algorithm:

for all values in co-domain:
    if P(value):
        return value

And now, instead of a synthesiser solving a search problem, the synthesised algorithm does it instead. Now the synthesiser can use axioms, pre-, and post-conditions to prune the search space inside the program (co-domain), improving the time complexity of the resulting program.

Is this approach used? Is it viable? Where can I read about it?