74HC Homebrew Computer - Calculating prime numbers

preview_player
Показать описание
Quick video demonstrating a program that calculates prime numbers sequentially. It uses a divide instruction to divide the tested number by all numbers up to itself (ideally it would be its square root) and if no divisor is found the number is deemed a prime. My division instruction uses an innefficient algorithm at the moment and will be changed some time in the future. This is only for illustration. The LED's of interest are the second set from right to left (8 lower bits).
Рекомендации по теме
Комментарии
Автор

Does this mean you can program purely in microcodes?

I ask this because I’ve always theorised that maybe op codes may not be optimised and wondered if op codes could be further optimised

iNireus
Автор

que incrivel isso, eu nem imagino o trabalho q isso deve ter dado, cara vc eh demais :) !

LeoOno