News for hackers. Stuff that matters.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by lordnacho on Thursday May 03, 2018 @03:27PM (#16989037)
Dude wrote his own language which compiles to an intermediate language, then Turing machines.

He then managed to test it on a simple statement about square numbers.

Sounds unimaginably complex.

How many people could help you write unit tests for such a thing?

Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by lmm on Friday May 04, 2018 @05:55AM (#16993360)
Sounds pretty straightforward. This is a normal way of working in functional languages: you write your business logic in a high-level representation (aka an "embedded DSL") and a succession of interpreters that interpret slightly higher-level representations into slightly lower-level representations, until you get down to one that you can implement directly. It's a nice structure for testing because you can test each interpreter separately on each of its instructions and then the composition behaviour is guaranteed.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by xyzzyz on Thursday May 03, 2018 @04:39PM (#16989723)
Sounds like an interesting assignment at a good undergrad compilers course.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by zeth___ on Thursday May 03, 2018 @08:01PM (#16991082)
Unit tests are mostly worthless for machines like this, you need formal proofs.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by sorokod on Thursday May 03, 2018 @03:41PM (#16989175)
BB(1) ?