Logo video2dn
  • Сохранить видео с ютуба
  • Категории
    • Музыка
    • Кино и Анимация
    • Автомобили
    • Животные
    • Спорт
    • Путешествия
    • Игры
    • Люди и Блоги
    • Юмор
    • Развлечения
    • Новости и Политика
    • Howto и Стиль
    • Diy своими руками
    • Образование
    • Наука и Технологии
    • Некоммерческие Организации
  • О сайте

Скачать или смотреть Emikomputer 6.4.0 recursive Fibonacci algorithm

  • Emika
  • 2025-12-10
  • 29
Emikomputer 6.4.0 recursive Fibonacci algorithm
  • ok logo

Скачать Emikomputer 6.4.0 recursive Fibonacci algorithm бесплатно в качестве 4к (2к / 1080p)

У нас вы можете скачать бесплатно Emikomputer 6.4.0 recursive Fibonacci algorithm или посмотреть видео с ютуба в максимальном доступном качестве.

Для скачивания выберите вариант из формы ниже:

  • Информация по загрузке:

Cкачать музыку Emikomputer 6.4.0 recursive Fibonacci algorithm бесплатно в формате MP3:

Если иконки загрузки не отобразились, ПОЖАЛУЙСТА, НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если у вас возникли трудности с загрузкой, пожалуйста, свяжитесь с нами по контактам, указанным в нижней части страницы.
Спасибо за использование сервиса video2dn.com

Описание к видео Emikomputer 6.4.0 recursive Fibonacci algorithm

this is version 6.4.0 of my own infrastructure. I have once again made a virtual machine for it from scratch, the fourth one now
It's written in C, without dependencies except the stdlib and the Linux kernel
I don't have an assembler yet, so I've written the code in machine language

ABOUT THE CPU:
Harvard infrastructure
4 bit instruction size
8 bit data size
16 registers, of which 7 special purposed
16 ALU operations
8 flags for conditional flow control or however that's called
The instruction memory can easily be replaced by another type, but the current one has 4096 nibbles of data
16 module slots. Modules are used for anything that isn't a register, ALU, control unit, or instruction memory. The one in the video had a 256 byte stack in module slot 0, and the rest were empty. I don't think you can do recursive algorithms without a stack-like datastructure, so I needed it, since it's not possible to do such a thing in the registers in my architecture

feel free to ask for more detail about the architecture in the comments, I can also talk about it on Discord if you're so inclined

PLANS FOR VERSION 6.4.1:
possibly change some of the optcodes
I still have a nop, I might wanna change the wrt optcode (it only writes to register 0 as of now), I might wanna replace cp0 by something else (it copies from register 0 to the specified one, which saves one instruction I guess)
I also changed how communication with modules works from the version 6.3, so I'll have to think if I actually like the new way. Basically, the communication has been simplified but also made less powerful
I also think I should change the new instruction sof, which is called that because it's stack overflow, but I actually use it as a general 'stop but not successfully' now. I don't think I actually like this.. I think I'm gonna remove it and either replace it by something or have another nop, and then add a new communication bit going from the instruction memory to the control unit to indicate a stack overflow, or just ignore them..

write an assembler, obviously..
write more instruction memories, and more modules
improve the interface, make it even prettier :3



and ye
thanks for reading [heart] (angle brackets aren't allowed for some reason)
bye

Комментарии

Информация по комментариям в разработке

Похожие видео

  • О нас
  • Контакты
  • Отказ от ответственности - Disclaimer
  • Условия использования сайта - TOS
  • Политика конфиденциальности

video2dn Copyright © 2023 - 2025

Контакты для правообладателей [email protected]