It broke on previous post saying it was asking for tech help

I understand that it has to do with cyber security but that’s about it.

I've been developing AutomataLab, an open-source desktop workbench for experimenting with formal languages and computational models.

It supports interactive simulations of finite automata, PDAs, and Turing machines, alongside grammar transformations and parsing algorithms such as LL(1), LR(1), LALR(1), CYK, and Earley.

The idea is to make abstract computational processes easier to inspect and understand.

GitHub: https://github.com/reeshavsinha/AutomataLab
Website: https://automata-lab-one.vercel.app

I'd be interested in feedback from people working with automata theory or compiler construction.

Parallelism i understand that Performing multiple tasks parallely at the same time

but what exactly asynchronous and concurrency means?

Traditional B-Trees waste substantial CPU cycles on pointer chasing across node levels, causing avoidable cache misses on modern architectures. The PGM-index approach (Ferragina & Vinciguerra, VLDB 2020: https://www.vldb.org/pvldb/vol13/p1162-ferragina.pdf) addresses this by modeling key distributions through streaming piecewise linear regression with strict +/- epsilon error bounds.

Instead of traversing tree nodes, key rank is predicted directly on the ALU (y = ax + b), bounding the local search window so that it fits entirely within L1 cache. The construction runs in a single O(N) streaming pass with zero external solvers.

I built a pure Rust reference implementation (v0.2.0) with zero dependencies to benchmark this against std::collections::BTreeMap across 1M keys: https://github.com/gilnett/learned_index_lab. Benchmarks across uniform and skewed distributions show a 99.9% reduction in index memory (~48 KB vs 45 MB) and 3x to 4.5x lower lookup latency.

While transactional engines still rely on B-Trees for in-place page writes, learned models provide significant advantages for read-heavy or immutable storage layouts (such as LSM SSTables and columnar stores) where pointer overhead is pure waste.

Has anyone here benchmarked or worked with learned data structures in storage systems? How do you approach optimal epsilon tuning when key distributions are non-uniform or unpredictable?

I've posted here before about x86, and I'm back with another take that I recently learned is "objectively wrong" as my coworker would say.

Java as a language is object-oriented, which is ultimately great for a multitude of reasons. The complaints that people like to throw out about verbosity is mostly just paraphrasing for "i like syntax candy more than any kind of structured code".

Java is only bad if you write it bad. If you think it's a bad language, then you probably just don't have a great grip on OOP. I've never worked so well in a team in anything besides Java. The fact that people will hate on Java then give their love to Python blows my mind. Python is essentially a useless pile of junk when you compare it to Java.

Anyways, I'm open to argumentation. My coworker is trying to brainwash me into thinking that Java is the worst language of all time. But, it's not. It's the best.

Hi, still new to algorithm analysis and need some help confirming my answer or not.

I assumed that best case would be O(1) in this scenario if size of the array is either 0 or 1. But trying to review my answer with online resources, it say's that O(1) doesn't count here?

What is the definite answer here?

EDIT: Hey everyone! Glad everyone got to interact and give responses. The answer was O(N) in the end! Confirmed with my professor.

I have finished computer science, and I always sucked at boolean expressions. But now, this game that I play got me interested in logic, and I wanna get to know more about it. I want to make a specific sequence in order to make my machines in game operate as I intend them to, but I have no clue how to go about it. Any advice is appreciated.

I stumbled upon the word interface when i stumbled upon the terminal in visual studio code. A terminal is a text based user interface which does lots of useful stuff.

That got me thinking about the word interface and what exactly it is in the computer sense. I understand user interface is the area or boundary between the human (user) and the computer( or rather software?) interacting with each other.

The problem is I am getting conflicting thoughts with current information I've searched and I'm unable to get a full understanding of the term.

So can someone please give their understanding/opinion of what an interface is in a broad computing sense. And can they also give multiple examples of different types of interfaces used in computer hardware and software too please.

Many thanks

The Song that Never Ends is iterative. It loops and is aware that it remains the same song.

The Song that Gets on Everybody's Nerves just sings about a song, and sings "this is how it goes:", calling itself.

Hello everyone, I'm a graduate with a Bachelor in English Language Studies (Business English & Corporate Communication track) and I'm looking to apply for the Language Science & Technology (LST) Master's program at Universität des Saarlandes (Germany).

I don't have a background in technology or computer science. My work experience mostly includes English Teaching for a year, then 1.5 year working as an English Communication Specialist (basically creating website & social contents, managing and translating huge amounts of website articles to English via CMS, working on admission and promotion campaigns & events,...)

But I'm looking to pivot into Tech recently, and after doing research, I'm really interested in Language Technology and found out about this Master program in Germany that is open to admit students with a background in linguistics (which is pretty rare since most program requires you to have a bachelor in computer science).

I know that I need to work extra, extra hard given my background. I've been taking up course on Coursera (Python for Everybody, Linear Algebra, Statistics,...) as the course's advisor advice to increase my chance of admission as well as to feel less overwhelming if I get admitted.

I'll continue to try and learn harder to make up for my lack of knowledge in the field.
Do you guys have any advices for someone looking to get into the field, and also during my time studying the program if I get admitted? Specifically to make learning smoother and to get a better chance at getting hired after graduating would be much appreciated.

Thank you everyone! :D

I’ve been reading some papers in the field - the trend is lots of text and sometimes graphs but that’s about it. It’s more a conceptual description of findings/visualisation than the actual proof/quantitative descriptions.

Anyone else feel this way?

I know C is programing language. It is not architecture specific. One writes the source code and a compiler turns it into an executable depending on what settings you tell it. So the same source code would output different executables depending on what you want to run it on and what optimization options are on. Assembly languages on the other hand are architecture specific. Is C "Assembly-like"? To be honest I'm not sure what would be Assembly-like. I guess if a program written in multiple languages that have the same behavior, if the C version (using something like GNU C Compiler) looked closer to its assembly than, say its Java version (GraalVM), then that counts.

Hello! 26f, studying law.

Formal logic has always been interesting to me, but it’s only been this past year that I’ve began to dip my toe into systems logic, Boolean/Fuzzy logic etc etc (sorry if my terms are all over the place, I began learning about systems engineering and went down a rabbit hole).

Basically, do any computer science peeps have any resources for a person who wants to learn more about systems engineering, and how it relates to the study of communication/argumentation logic?

Thank you!

Can I say the above? I think of this after studying trees and graph. Singly linked list in particular.

I'm trying to design a mechanical computer.

Why? Idk. But now I'm building Tascii, and I've even figured out how to use tape and hole punching to talk to it... but storing the data and processing, let alone assigning values to various tascii sets is hard. Data enclosed.

Yes... my computer uses see saws

Although I’ve done some googling I think they still use big English to explain this concept. I think I know them but I just wanted to ask if I can get a simple explanation from the house plz