MétaCan
Menu
Back to cohort
Record W4409891331 · doi:10.12700/aph.22.5.2025.5.5

Design and Implementation of a Laboratory Prototype for Boolean Function Simplification in Real Time

2025· article· en· W4409891331 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueActa Polytechnica Hungarica · 2025
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceFunction (biology)Boolean functionProgramming languageAlgorithm

Abstract

fetched live from OpenAlex

The aim of this study is to develop a three-variable Karnaugh-Map (K-MAP) in hardware.K-MAPs are extensively used in digital logic design for simplifying Boolean expressions.Here, we automate the process of Boolean expression simplification by designing a K-MAP hardware circuit, that can show the simplified expression in real-time.The hardware is comprised of input, combinatory, comparator, and output units.The input unit accepts minterms from the DIP switches.These minterms are processed in combinatory unit against all the possible combinations of boxes in power-of-two.The output from the boxes with higher power-of-two is kept in the comparator unit and the result is displayed on LEDs in the output unit.The proposed hardware design can be used in a classroom setting to teach the concepts of Boolean function simplification and verify the practice problems.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.857
Threshold uncertainty score0.380

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.009
GPT teacher head0.274
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it